/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:12:34,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:12:34,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:12:34,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:12:34,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:12:34,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:12:34,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:12:34,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:12:34,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:12:34,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:12:34,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:12:34,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:12:34,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:12:34,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:12:34,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:12:34,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:12:34,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:12:34,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:12:34,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:12:34,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:12:34,119 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:12:34,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:12:34,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:12:34,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:12:34,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:12:34,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:12:34,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:12:34,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:12:34,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:12:34,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:12:34,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:12:34,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:12:34,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:12:34,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:12:34,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:12:34,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:12:34,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:12:34,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:12:34,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:12:34,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:12:34,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:12:34,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:12:34,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:12:34,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:12:34,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:12:34,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:12:34,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:12:34,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:12:34,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:12:34,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:12:34,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:12:34,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:12:34,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:12:34,144 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:12:34,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:12:34,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:12:34,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:12:34,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:12:34,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:12:34,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:12:34,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:12:34,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:12:34,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:12:34,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:12:34,146 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:12:34,146 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:12:34,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:12:34,146 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:12:34,147 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 08:12:34,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:12:34,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:12:34,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:12:34,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:12:34,441 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:12:34,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-15 08:12:34,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53f76a9/86eb6795b87f4882bb35e74cff96b58c/FLAGe0e48012a [2022-04-15 08:12:34,943 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:12:34,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-15 08:12:34,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53f76a9/86eb6795b87f4882bb35e74cff96b58c/FLAGe0e48012a [2022-04-15 08:12:35,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53f76a9/86eb6795b87f4882bb35e74cff96b58c [2022-04-15 08:12:35,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:12:35,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:12:35,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:12:35,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:12:35,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:12:35,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9a59b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35, skipping insertion in model container [2022-04-15 08:12:35,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:12:35,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:12:35,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2022-04-15 08:12:35,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:12:35,528 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:12:35,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2022-04-15 08:12:35,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:12:35,557 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:12:35,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35 WrapperNode [2022-04-15 08:12:35,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:12:35,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:12:35,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:12:35,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:12:35,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:12:35,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:12:35,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:12:35,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:12:35,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (1/1) ... [2022-04-15 08:12:35,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:12:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:35,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 08:12:35,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 08:12:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:12:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:12:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:12:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:12:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:12:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:12:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:12:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:12:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 08:12:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 08:12:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:12:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:12:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 08:12:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:12:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:12:35,711 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:12:35,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:12:35,838 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:12:35,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:12:35,845 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:12:35,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:12:35 BoogieIcfgContainer [2022-04-15 08:12:35,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:12:35,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:12:35,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:12:35,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:12:35,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:12:35" (1/3) ... [2022-04-15 08:12:35,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17215326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:12:35, skipping insertion in model container [2022-04-15 08:12:35,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:35" (2/3) ... [2022-04-15 08:12:35,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17215326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:12:35, skipping insertion in model container [2022-04-15 08:12:35,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:12:35" (3/3) ... [2022-04-15 08:12:35,861 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2022-04-15 08:12:35,865 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:12:35,866 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:12:35,905 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:12:35,910 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:12:35,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:12:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:12:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:12:35,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:35,946 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:35,947 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-15 08:12:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:35,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113188139] [2022-04-15 08:12:35,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-15 08:12:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891909348] [2022-04-15 08:12:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:12:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:36,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 08:12:36,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 08:12:36,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 08:12:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 08:12:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:36,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:36,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:36,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:36,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 08:12:36,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 08:12:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:36,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:36,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:36,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:36,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 08:12:36,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:12:36,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 08:12:36,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 08:12:36,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 08:12:36,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-15 08:12:36,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-15 08:12:36,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-15 08:12:36,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:36,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:36,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:36,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 08:12:36,211 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-15 08:12:36,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:36,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:36,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:36,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 08:12:36,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-15 08:12:36,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 08:12:36,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 08:12:36,213 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-15 08:12:36,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 08:12:36,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 08:12:36,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 08:12:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:36,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891909348] [2022-04-15 08:12:36,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891909348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:36,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:36,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:36,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113188139] [2022-04-15 08:12:36,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113188139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:36,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:36,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329164292] [2022-04-15 08:12:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:12:36,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:36,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:36,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:36,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:12:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:12:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:36,288 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:36,493 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 08:12:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:12:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:12:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 08:12:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 08:12:36,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-15 08:12:36,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:36,657 INFO L225 Difference]: With dead ends: 60 [2022-04-15 08:12:36,657 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 08:12:36,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:36,663 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:36,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 08:12:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 08:12:36,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:36,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:36,713 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:36,713 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:36,722 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 08:12:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 08:12:36,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:36,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:36,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 08:12:36,723 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 08:12:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:36,727 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 08:12:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 08:12:36,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:36,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:36,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:36,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 08:12:36,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-15 08:12:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:36,732 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 08:12:36,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:36,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 08:12:36,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 08:12:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 08:12:36,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:36,781 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:36,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:12:36,782 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-15 08:12:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:36,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151114417] [2022-04-15 08:12:36,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-15 08:12:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:36,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776826175] [2022-04-15 08:12:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:36,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:36,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089080644] [2022-04-15 08:12:36,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:36,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:36,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 08:12:36,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:36,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:36,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:12:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:36,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:37,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-15 08:12:37,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,165 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-15 08:12:37,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 2);havoc #t~post3; {287#false} is VALID [2022-04-15 08:12:37,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-15 08:12:37,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 2);havoc #t~post4; {287#false} is VALID [2022-04-15 08:12:37,169 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-15 08:12:37,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 08:12:37,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 08:12:37,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 08:12:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:37,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:37,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776826175] [2022-04-15 08:12:37,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089080644] [2022-04-15 08:12:37,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089080644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:37,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:37,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:12:37,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151114417] [2022-04-15 08:12:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151114417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:37,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:37,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:12:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390692392] [2022-04-15 08:12:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 08:12:37,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:37,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:37,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:12:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:12:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:12:37,195 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:37,265 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 08:12:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:12:37,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 08:12:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 08:12:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 08:12:37,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 08:12:37,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:37,316 INFO L225 Difference]: With dead ends: 42 [2022-04-15 08:12:37,316 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 08:12:37,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:12:37,318 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:37,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 08:12:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 08:12:37,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:37,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:37,332 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:37,333 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:37,335 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 08:12:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:37,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:37,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:37,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 08:12:37,336 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 08:12:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:37,339 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 08:12:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:37,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:37,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:37,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:37,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 08:12:37,342 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-15 08:12:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:37,342 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 08:12:37,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 08:12:37,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:12:37,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:37,378 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:37,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:12:37,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:37,592 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-15 08:12:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:37,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495814994] [2022-04-15 08:12:37,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-15 08:12:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:37,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365307775] [2022-04-15 08:12:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:37,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791700535] [2022-04-15 08:12:37,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:37,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:37,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:37,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:37,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 08:12:37,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:37,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:37,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:12:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:37,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:37,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 08:12:37,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,919 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:37,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:37,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:37,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:37,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-15 08:12:37,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 2);havoc #t~post4; {569#false} is VALID [2022-04-15 08:12:37,923 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-15 08:12:37,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 08:12:37,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 08:12:37,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 08:12:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:37,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:37,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365307775] [2022-04-15 08:12:37,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:37,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791700535] [2022-04-15 08:12:37,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791700535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:37,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:37,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:12:37,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:37,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495814994] [2022-04-15 08:12:37,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495814994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:37,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:37,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:12:37,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041001396] [2022-04-15 08:12:37,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:37,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 08:12:37,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:37,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:37,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:37,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:12:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:12:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:12:37,950 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:38,054 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:12:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:12:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 08:12:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 08:12:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 08:12:38,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 08:12:38,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:38,098 INFO L225 Difference]: With dead ends: 41 [2022-04-15 08:12:38,098 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 08:12:38,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:12:38,099 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:38,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 08:12:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 08:12:38,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:38,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:38,113 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:38,114 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:38,116 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 08:12:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 08:12:38,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:38,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:38,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 08:12:38,117 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 08:12:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:38,119 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 08:12:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 08:12:38,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:38,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:38,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:38,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-15 08:12:38,122 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-15 08:12:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:38,122 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-15 08:12:38,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:38,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-15 08:12:38,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 08:12:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:12:38,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:38,160 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 08:12:38,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 08:12:38,385 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-15 08:12:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:38,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [83669657] [2022-04-15 08:12:38,386 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-15 08:12:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:38,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670126766] [2022-04-15 08:12:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:38,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:38,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970948016] [2022-04-15 08:12:38,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:38,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:38,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 08:12:38,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:38,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:38,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 08:12:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:38,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:38,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 08:12:39,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-15 08:12:39,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:39,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-15 08:12:39,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-15 08:12:39,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-15 08:12:39,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-15 08:12:39,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 08:12:39,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 08:12:39,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:39,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-15 08:12:39,002 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-15 08:12:39,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 08:12:39,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 08:12:39,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:39,002 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-15 08:12:39,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 2);havoc #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:39,007 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:12:39,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:12:39,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-15 08:12:39,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 08:12:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:39,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670126766] [2022-04-15 08:12:39,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970948016] [2022-04-15 08:12:39,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970948016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:39,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:39,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:39,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [83669657] [2022-04-15 08:12:39,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [83669657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:39,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:39,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077707556] [2022-04-15 08:12:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:39,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 08:12:39,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:39,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:39,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:39,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:12:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:39,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:12:39,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:12:39,034 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:41,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 08:12:43,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 08:12:45,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 08:12:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:45,535 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 08:12:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:12:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 08:12:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 08:12:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 08:12:45,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-15 08:12:45,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:45,603 INFO L225 Difference]: With dead ends: 50 [2022-04-15 08:12:45,604 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 08:12:45,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:12:45,605 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:45,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 08:12:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 08:12:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-15 08:12:45,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:45,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:45,628 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:45,628 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:45,630 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 08:12:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 08:12:45,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:45,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 08:12:45,632 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 08:12:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:45,634 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 08:12:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 08:12:45,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:45,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:45,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:45,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 08:12:45,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-15 08:12:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:45,637 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 08:12:45,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:45,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 08:12:45,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 08:12:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 08:12:45,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:45,694 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:45,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 08:12:45,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:45,908 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-15 08:12:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386824333] [2022-04-15 08:12:45,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-15 08:12:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121166202] [2022-04-15 08:12:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:45,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227998286] [2022-04-15 08:12:45,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:45,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:45,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:12:46,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:12:46,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:46,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:12:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:46,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:46,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1221#true} {1221#true} #89#return; {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {1221#true} call #t~ret5 := main(); {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {1221#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1221#true} is VALID [2022-04-15 08:12:46,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1221#true} #81#return; {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:12:46,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:12:46,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:12:46,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:12:46,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1221#true} #83#return; {1221#true} is VALID [2022-04-15 08:12:46,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {1221#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 2);havoc #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,122 INFO L272 TraceCheckUtils]: 22: Hoare triple {1274#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:12:46,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:12:46,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:12:46,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:12:46,123 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1274#(= main_~B~0 main_~b~0)} #85#return; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:12:46,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1222#false} is VALID [2022-04-15 08:12:46,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {1222#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1222#false} is VALID [2022-04-15 08:12:46,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {1222#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1222#false} is VALID [2022-04-15 08:12:46,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#false} assume !(#t~post4 < 2);havoc #t~post4; {1222#false} is VALID [2022-04-15 08:12:46,124 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 08:12:46,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 08:12:46,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 08:12:46,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 08:12:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:46,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:46,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121166202] [2022-04-15 08:12:46,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:46,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227998286] [2022-04-15 08:12:46,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227998286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:46,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:46,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:46,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:46,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386824333] [2022-04-15 08:12:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386824333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:46,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:46,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672496668] [2022-04-15 08:12:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 08:12:46,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:46,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:12:46,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:46,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:12:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:12:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:46,157 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:12:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:46,264 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 08:12:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:12:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 08:12:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:12:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 08:12:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:12:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 08:12:46,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 08:12:46,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:46,319 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:12:46,320 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 08:12:46,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:46,321 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:46,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 08:12:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 08:12:46,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:46,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:46,343 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:46,344 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:46,346 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 08:12:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:12:46,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:46,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:46,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 08:12:46,347 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 08:12:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:46,348 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 08:12:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:12:46,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:46,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:46,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:46,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-15 08:12:46,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-15 08:12:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:46,351 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-15 08:12:46,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:12:46,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-15 08:12:46,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:12:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 08:12:46,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:46,409 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:46,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:12:46,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:46,628 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-15 08:12:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898231325] [2022-04-15 08:12:46,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-15 08:12:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:46,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205220216] [2022-04-15 08:12:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:46,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:46,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975354925] [2022-04-15 08:12:46,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:46,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:46,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:46,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:46,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:12:46,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:12:46,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:46,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:12:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:46,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:46,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 08:12:46,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,932 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:46,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:46,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:46,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:46,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:12:46,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-15 08:12:46,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#false} assume !(0 == ~cond); {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#false} assume true; {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1619#false} {1619#false} #85#return; {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-15 08:12:46,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 08:12:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 08:12:46,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:12:47,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 08:12:47,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 08:12:47,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 08:12:47,166 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 08:12:47,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 08:12:47,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-15 08:12:47,171 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1618#true} {1619#false} #85#return; {1619#false} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 08:12:47,171 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1618#true} is VALID [2022-04-15 08:12:47,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 08:12:47,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 08:12:47,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-15 08:12:47,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:12:47,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:47,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:47,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:47,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 08:12:47,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 08:12:47,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 08:12:47,180 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1618#true} is VALID [2022-04-15 08:12:47,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 08:12:47,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 08:12:47,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 08:12:47,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1618#true} is VALID [2022-04-15 08:12:47,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:47,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 08:12:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 08:12:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:47,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205220216] [2022-04-15 08:12:47,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:47,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975354925] [2022-04-15 08:12:47,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975354925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:12:47,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:12:47,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 08:12:47,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:47,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898231325] [2022-04-15 08:12:47,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898231325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:47,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:47,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:12:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800938577] [2022-04-15 08:12:47,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 08:12:47,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:47,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:47,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:47,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:12:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:12:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:12:47,220 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:47,370 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 08:12:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:12:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 08:12:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 08:12:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 08:12:47,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 08:12:47,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:47,420 INFO L225 Difference]: With dead ends: 63 [2022-04-15 08:12:47,420 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 08:12:47,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:12:47,421 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:47,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 08:12:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 08:12:47,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:47,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:47,447 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:47,448 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:47,454 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 08:12:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:12:47,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:47,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:47,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 08:12:47,456 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 08:12:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:47,458 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 08:12:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:12:47,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:47,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:47,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:47,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:12:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-15 08:12:47,460 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-15 08:12:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:47,460 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-15 08:12:47,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:47,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-15 08:12:47,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:12:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 08:12:47,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:47,515 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:47,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 08:12:47,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:47,724 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-15 08:12:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:47,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770157621] [2022-04-15 08:12:47,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-15 08:12:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:47,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745416759] [2022-04-15 08:12:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:47,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:47,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849091961] [2022-04-15 08:12:47,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:47,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:47,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:12:47,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:12:47,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:12:47,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:47,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:12:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:47,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:48,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {2140#true} call ULTIMATE.init(); {2140#true} is VALID [2022-04-15 08:12:48,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2148#(<= 0 ~counter~0)} {2140#true} #89#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {2148#(<= 0 ~counter~0)} call #t~ret5 := main(); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {2148#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #81#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #83#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {2148#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 08:12:48,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {2148#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 08:12:48,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 08:12:48,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 08:12:48,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 08:12:48,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#(<= 2 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 08:12:48,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 08:12:48,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#(<= 2 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2217#(<= 2 |main_#t~post4|)} is VALID [2022-04-15 08:12:48,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2217#(<= 2 |main_#t~post4|)} assume !!(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-15 08:12:48,031 INFO L272 TraceCheckUtils]: 25: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-15 08:12:48,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-15 08:12:48,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {2141#false} assume !(0 == ~cond); {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {2141#false} assume true; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2141#false} {2141#false} #85#return; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {2141#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {2141#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {2141#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {2141#false} assume !(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L272 TraceCheckUtils]: 34: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-15 08:12:48,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {2141#false} assume 0 == ~cond; {2141#false} is VALID [2022-04-15 08:12:48,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {2141#false} assume !false; {2141#false} is VALID [2022-04-15 08:12:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 08:12:48,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:48,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745416759] [2022-04-15 08:12:48,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849091961] [2022-04-15 08:12:48,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849091961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:48,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:48,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:48,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770157621] [2022-04-15 08:12:48,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770157621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:48,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:48,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456497305] [2022-04-15 08:12:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:48,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 08:12:48,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:48,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:48,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:48,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:12:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:48,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:12:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:12:48,068 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:48,200 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 08:12:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:12:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 08:12:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 08:12:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 08:12:48,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 08:12:48,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:48,236 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:12:48,236 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 08:12:48,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:12:48,237 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:48,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 08:12:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 08:12:48,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:48,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 08:12:48,238 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 08:12:48,239 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 08:12:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:48,239 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:12:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:12:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:48,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 08:12:48,239 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 08:12:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:48,239 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:12:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:12:48,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:48,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:48,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:48,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 08:12:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 08:12:48,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-15 08:12:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:48,240 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 08:12:48,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:12:48,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 08:12:48,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:12:48,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:48,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 08:12:48,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 08:12:48,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:48,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 08:12:49,003 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 08:12:49,004 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 08:12:49,004 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 08:12:49,004 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-15 08:12:49,004 INFO L885 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: true [2022-04-15 08:12:49,004 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-15 08:12:49,004 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: true [2022-04-15 08:12:49,004 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,004 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,004 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 52) the Hoare annotation is: true [2022-04-15 08:12:49,005 INFO L885 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-04-15 08:12:49,005 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 52) the Hoare annotation is: true [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 49) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post4|)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= |main_#t~post3| 0) (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,005 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 26 52) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point L41-1(lines 40 49) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:12:49,006 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:12:49,006 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 08:12:49,006 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 08:12:49,006 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-15 08:12:49,006 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 08:12:49,007 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:12:49,007 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 08:12:49,007 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:12:49,010 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-15 08:12:49,011 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 08:12:49,015 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:12:49,015 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:12:49,018 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 08:12:49,044 INFO L163 areAnnotationChecker]: CFG has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 08:12:49,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 08:12:49 BoogieIcfgContainer [2022-04-15 08:12:49,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 08:12:49,074 INFO L158 Benchmark]: Toolchain (without parser) took 13731.02ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 128.3MB in the beginning and 198.1MB in the end (delta: -69.8MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. [2022-04-15 08:12:49,074 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 08:12:49,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 175.1MB. Free memory was 128.2MB in the beginning and 152.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 08:12:49,075 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 175.1MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 08:12:49,075 INFO L158 Benchmark]: RCFGBuilder took 257.62ms. Allocated memory is still 175.1MB. Free memory was 151.3MB in the beginning and 139.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 08:12:49,075 INFO L158 Benchmark]: TraceAbstraction took 13223.12ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 139.0MB in the beginning and 198.1MB in the end (delta: -59.2MB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. [2022-04-15 08:12:49,081 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 175.1MB. Free memory was 128.2MB in the beginning and 152.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 175.1MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.62ms. Allocated memory is still 175.1MB. Free memory was 151.3MB in the beginning and 139.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13223.12ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 139.0MB in the beginning and 198.1MB in the end (delta: -59.2MB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 212 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 137 PreInvPairs, 184 NumberOfFragments, 361 HoareAnnotationTreeSize, 137 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 332 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || (((A == r && 0 <= counter) && B == b) && q == 0)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 08:12:49,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...