/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:59:39,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:59:39,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:59:39,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:59:39,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:59:39,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:59:39,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:59:39,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:59:39,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:59:39,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:59:39,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:59:39,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:59:39,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:59:39,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:59:39,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:59:39,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:59:39,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:59:39,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:59:39,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:59:39,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:59:39,042 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:59:39,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:59:39,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:59:39,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:59:39,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:59:39,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:59:39,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:59:39,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:59:39,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:59:39,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:59:39,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:59:39,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:59:39,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:59:39,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:59:39,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:59:39,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:59:39,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:59:39,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:59:39,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:59:39,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:59:39,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:59:39,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:59:39,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:59:39,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:59:39,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:59:39,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:59:39,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:59:39,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:59:39,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:59:39,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:59:39,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:59:39,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:59:39,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:59:39,063 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:59:39,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:59:39,064 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:59:39,064 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:59:39,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:59:39,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:59:39,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:59:39,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:59:39,288 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:59:39,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-08 04:59:39,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69842fb4/5acb6906acb9428da2f761bc4eedf8f6/FLAG3aeea1d02 [2022-04-08 04:59:39,715 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:59:39,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-08 04:59:39,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69842fb4/5acb6906acb9428da2f761bc4eedf8f6/FLAG3aeea1d02 [2022-04-08 04:59:39,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69842fb4/5acb6906acb9428da2f761bc4eedf8f6 [2022-04-08 04:59:39,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:59:39,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:59:39,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:59:39,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:59:39,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:59:39,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2462c871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39, skipping insertion in model container [2022-04-08 04:59:39,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:59:39,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:59:39,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] [2022-04-08 04:59:39,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:59:39,951 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:59:39,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i[951,964] [2022-04-08 04:59:39,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:59:39,972 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:59:39,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39 WrapperNode [2022-04-08 04:59:39,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:59:39,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:59:39,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:59:39,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:59:39,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:39,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:59:39,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:59:39,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:59:39,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:59:39,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (1/1) ... [2022-04-08 04:59:40,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:59:40,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:59:40,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:59:40,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:59:40,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:59:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:59:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:59:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:59:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:59:40,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:59:40,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:59:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:59:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 04:59:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 04:59:40,088 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:59:40,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:59:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:59:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:59:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:59:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:59:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:59:40,155 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:59:40,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:59:40,302 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:59:40,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:59:40,315 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:59:40,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:59:40 BoogieIcfgContainer [2022-04-08 04:59:40,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:59:40,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:59:40,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:59:40,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:59:40,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:59:39" (1/3) ... [2022-04-08 04:59:40,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb1458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:59:40, skipping insertion in model container [2022-04-08 04:59:40,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:59:39" (2/3) ... [2022-04-08 04:59:40,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb1458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:59:40, skipping insertion in model container [2022-04-08 04:59:40,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:59:40" (3/3) ... [2022-04-08 04:59:40,336 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound1.i [2022-04-08 04:59:40,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:59:40,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:59:40,387 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:59:40,396 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:59:40,396 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:59:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:59:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:59:40,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:59:40,429 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:59:40,429 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:59:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:59:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-08 04:59:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:40,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842449542] [2022-04-08 04:59:40,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:59:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-08 04:59:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:59:40,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593615708] [2022-04-08 04:59:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:59:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:59:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:59:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:40,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 04:59:40,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 04:59:40,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 04:59:40,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:59:40,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-08 04:59:40,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 04:59:40,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-08 04:59:40,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-08 04:59:40,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-08 04:59:40,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 04:59:40,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-08 04:59:40,661 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-08 04:59:40,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 04:59:40,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 04:59:40,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 04:59:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:59:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:59:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593615708] [2022-04-08 04:59:40,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593615708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:40,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:40,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:59:40,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:59:40,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842449542] [2022-04-08 04:59:40,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842449542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:40,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:40,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:59:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802900994] [2022-04-08 04:59:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:59:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 04:59:40,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:59:40,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:40,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:40,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:59:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:59:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:59:40,745 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:40,913 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-08 04:59:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:59:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 04:59:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:59:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 04:59:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 04:59:40,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 04:59:40,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:40,992 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:59:40,992 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 04:59:40,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:59:41,002 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:59:41,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:59:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 04:59:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 04:59:41,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:59:41,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,031 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,031 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:41,035 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 04:59:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 04:59:41,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:41,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:41,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 04:59:41,036 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-08 04:59:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:41,040 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 04:59:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 04:59:41,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:41,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:41,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:59:41,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:59:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-08 04:59:41,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-08 04:59:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:59:41,046 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-08 04:59:41,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-08 04:59:41,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-08 04:59:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:59:41,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:59:41,101 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:59:41,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:59:41,102 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:59:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:59:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-08 04:59:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:41,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463345124] [2022-04-08 04:59:41,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:59:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-08 04:59:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:59:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452687857] [2022-04-08 04:59:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:59:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:59:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:59:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:41,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:59:41,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-08 04:59:41,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-08 04:59:41,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 1);havoc #t~post2; {212#false} is VALID [2022-04-08 04:59:41,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-08 04:59:41,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 1);havoc #t~post3; {212#false} is VALID [2022-04-08 04:59:41,172 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-08 04:59:41,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-08 04:59:41,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-08 04:59:41,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-08 04:59:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:59:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:59:41,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452687857] [2022-04-08 04:59:41,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452687857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:41,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:41,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:59:41,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:59:41,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463345124] [2022-04-08 04:59:41,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463345124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:41,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:41,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:59:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942827849] [2022-04-08 04:59:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:59:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:59:41,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:59:41,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:41,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:59:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:59:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:59:41,187 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:41,327 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 04:59:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:59:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:59:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:59:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 04:59:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 04:59:41,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 04:59:41,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:41,382 INFO L225 Difference]: With dead ends: 35 [2022-04-08 04:59:41,382 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:59:41,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:59:41,384 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:59:41,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:59:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:59:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:59:41,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:59:41,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,392 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,392 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:41,394 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 04:59:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:59:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:41,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:41,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 04:59:41,395 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 04:59:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:41,396 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 04:59:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:59:41,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:41,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:41,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:59:41,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:59:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 04:59:41,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-08 04:59:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:59:41,398 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 04:59:41,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 04:59:41,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:59:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:59:41,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:59:41,434 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:59:41,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:59:41,434 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:59:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:59:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-08 04:59:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:41,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312485265] [2022-04-08 04:59:41,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:59:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-08 04:59:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:59:41,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136384951] [2022-04-08 04:59:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:59:41,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:59:41,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:59:41,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333497774] [2022-04-08 04:59:41,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:59:41,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:59:41,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:59:41,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:59:41,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:59:41,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:59:41,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:59:41,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 04:59:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:41,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:59:41,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-08 04:59:41,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {385#true} is VALID [2022-04-08 04:59:41,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 04:59:41,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #82#return; {385#true} is VALID [2022-04-08 04:59:41,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret4 := main(); {385#true} is VALID [2022-04-08 04:59:41,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 1);havoc #t~post2; {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {405#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 1);havoc #t~post3; {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:41,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {415#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {425#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:59:41,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {429#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:59:41,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-08 04:59:41,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 04:59:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:59:41,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:59:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:59:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136384951] [2022-04-08 04:59:41,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:59:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333497774] [2022-04-08 04:59:41,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333497774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:41,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:41,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:59:41,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:59:41,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312485265] [2022-04-08 04:59:41,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312485265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:41,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:41,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:59:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021009788] [2022-04-08 04:59:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:59:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 04:59:41,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:59:41,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:41,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:41,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:59:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:59:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:59:41,896 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,068 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-08 04:59:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:59:42,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 04:59:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:59:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 04:59:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 04:59:42,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 04:59:42,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:42,108 INFO L225 Difference]: With dead ends: 35 [2022-04-08 04:59:42,108 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:59:42,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:59:42,109 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:59:42,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:59:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:59:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:59:42,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:59:42,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,122 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,123 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,126 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 04:59:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 04:59:42,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:42,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:42,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 04:59:42,130 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-08 04:59:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,134 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 04:59:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 04:59:42,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:42,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:42,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:59:42,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:59:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 04:59:42,136 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-08 04:59:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:59:42,137 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 04:59:42,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 04:59:42,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 04:59:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:59:42,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:59:42,169 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:59:42,199 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-08 04:59:42,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:59:42,384 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:59:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:59:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-08 04:59:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:42,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667113069] [2022-04-08 04:59:42,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:59:42,403 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:59:42,403 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:59:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-08 04:59:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:59:42,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116425514] [2022-04-08 04:59:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:59:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:59:42,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:59:42,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8672539] [2022-04-08 04:59:42,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:59:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:59:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:59:42,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:59:42,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:59:42,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:59:42,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:59:42,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:59:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:42,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:59:42,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2022-04-08 04:59:42,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {635#true} is VALID [2022-04-08 04:59:42,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {635#true} assume true; {635#true} is VALID [2022-04-08 04:59:42,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {635#true} {635#true} #82#return; {635#true} is VALID [2022-04-08 04:59:42,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {635#true} call #t~ret4 := main(); {635#true} is VALID [2022-04-08 04:59:42,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {635#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 1);havoc #t~post2; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 1);havoc #t~post2; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 1);havoc #t~post3; {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 04:59:42,569 INFO L272 TraceCheckUtils]: 13: Hoare triple {655#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:59:42,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:59:42,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {636#false} is VALID [2022-04-08 04:59:42,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#false} assume !false; {636#false} is VALID [2022-04-08 04:59:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 04:59:42,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:59:42,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:59:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116425514] [2022-04-08 04:59:42,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:59:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8672539] [2022-04-08 04:59:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8672539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:42,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:42,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:59:42,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:59:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667113069] [2022-04-08 04:59:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667113069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:59:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084091457] [2022-04-08 04:59:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:59:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:59:42,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:59:42,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:42,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:59:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:59:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:59:42,592 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,716 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 04:59:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:59:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:59:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:59:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 04:59:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 04:59:42,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 04:59:42,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:42,756 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:59:42,756 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 04:59:42,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:59:42,759 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:59:42,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:59:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 04:59:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-08 04:59:42,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:59:42,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,778 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,779 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,781 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 04:59:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 04:59:42,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:42,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:42,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 04:59:42,783 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-08 04:59:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:42,786 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 04:59:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 04:59:42,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:42,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:42,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:59:42,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:59:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:59:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-08 04:59:42,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-08 04:59:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:59:42,791 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-08 04:59:42,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:59:42,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-08 04:59:42,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 04:59:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:59:42,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:59:42,823 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:59:42,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:59:43,035 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,SelfDestructingSolverStorable3 [2022-04-08 04:59:43,036 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:59:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:59:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-08 04:59:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:43,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [600788233] [2022-04-08 04:59:43,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:59:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-08 04:59:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:59:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493999684] [2022-04-08 04:59:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:59:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:59:43,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:59:43,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270092059] [2022-04-08 04:59:43,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:59:43,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:59:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:59:43,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:59:43,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:59:43,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:59:43,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:59:43,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:59:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:59:43,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:59:43,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2022-04-08 04:59:43,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {934#(<= 0 ~counter~0)} is VALID [2022-04-08 04:59:43,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#(<= 0 ~counter~0)} assume true; {934#(<= 0 ~counter~0)} is VALID [2022-04-08 04:59:43,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#(<= 0 ~counter~0)} {926#true} #82#return; {934#(<= 0 ~counter~0)} is VALID [2022-04-08 04:59:43,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#(<= 0 ~counter~0)} call #t~ret4 := main(); {934#(<= 0 ~counter~0)} is VALID [2022-04-08 04:59:43,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#(<= 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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {934#(<= 0 ~counter~0)} is VALID [2022-04-08 04:59:43,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {950#(<= 1 ~counter~0)} is VALID [2022-04-08 04:59:43,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(<= 1 ~counter~0)} assume !!(#t~post2 < 1);havoc #t~post2; {950#(<= 1 ~counter~0)} is VALID [2022-04-08 04:59:43,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {950#(<= 1 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {950#(<= 1 ~counter~0)} is VALID [2022-04-08 04:59:43,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {960#(<= 1 |main_#t~post3|)} is VALID [2022-04-08 04:59:43,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {960#(<= 1 |main_#t~post3|)} assume !!(#t~post3 < 1);havoc #t~post3; {927#false} is VALID [2022-04-08 04:59:43,233 INFO L272 TraceCheckUtils]: 11: Hoare triple {927#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {927#false} is VALID [2022-04-08 04:59:43,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2022-04-08 04:59:43,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#false} assume !(0 == ~cond); {927#false} is VALID [2022-04-08 04:59:43,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {927#false} assume true; {927#false} is VALID [2022-04-08 04:59:43,234 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {927#false} {927#false} #78#return; {927#false} is VALID [2022-04-08 04:59:43,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {927#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); {927#false} is VALID [2022-04-08 04:59:43,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {927#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {927#false} is VALID [2022-04-08 04:59:43,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {927#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {927#false} is VALID [2022-04-08 04:59:43,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {927#false} assume !(#t~post3 < 1);havoc #t~post3; {927#false} is VALID [2022-04-08 04:59:43,234 INFO L272 TraceCheckUtils]: 20: Hoare triple {927#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {927#false} is VALID [2022-04-08 04:59:43,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2022-04-08 04:59:43,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {927#false} assume 0 == ~cond; {927#false} is VALID [2022-04-08 04:59:43,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {927#false} assume !false; {927#false} is VALID [2022-04-08 04:59:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 04:59:43,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:59:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:59:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493999684] [2022-04-08 04:59:43,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:59:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270092059] [2022-04-08 04:59:43,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270092059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:43,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:43,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:59:43,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:59:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [600788233] [2022-04-08 04:59:43,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [600788233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:59:43,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:59:43,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:59:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693225165] [2022-04-08 04:59:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:59:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 04:59:43,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:59:43,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:43,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:43,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:59:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:59:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:59:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:59:43,254 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:43,297 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 04:59:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:59:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-08 04:59:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:59:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-08 04:59:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-08 04:59:43,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-08 04:59:43,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:59:43,326 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:59:43,326 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:59:43,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:59:43,327 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:59:43,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:59:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:59:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:59:43,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:59:43,328 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-08 04:59:43,328 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-08 04:59:43,328 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-08 04:59:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:43,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:59:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:59:43,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:43,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:43,329 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-08 04:59:43,329 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-08 04:59:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:59:43,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:59:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:59:43,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:43,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:59:43,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:59:43,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:59:43,330 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-08 04:59:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:59:43,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-08 04:59:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:59:43,330 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:59:43,330 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:59:43,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:59:43,331 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-08 04:59:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:59:43,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:59:43,333 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:59:43,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:59:43,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:59:43,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:59:43,772 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 04:59:43,772 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 04:59:43,772 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 04:59:43,773 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-08 04:59:43,773 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-08 04:59:43,773 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-08 04:59:43,773 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-08 04:59:43,773 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 50) the Hoare annotation is: true [2022-04-08 04:59:43,773 INFO L885 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2022-04-08 04:59:43,773 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 50) the Hoare annotation is: true [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0) (<= 1 |main_#t~post3|)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 47) 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-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 37) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (= main_~b~0 1) .cse0 (<= 0 ~counter~0) .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L43(lines 43 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,774 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,775 INFO L878 garLoopResultBuilder]: At program point L39-1(lines 38 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,775 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 04:59:43,775 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 04:59:43,775 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-08 04:59:43,775 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 04:59:43,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:59:43,775 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 04:59:43,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:59:43,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:59:43,775 INFO L885 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: true [2022-04-08 04:59:43,776 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-08 04:59:43,776 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: true [2022-04-08 04:59:43,776 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 04:59:43,776 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-08 04:59:43,776 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 04:59:43,779 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-08 04:59:43,780 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:59:43,783 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:59:43,783 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:59:43,785 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 04:59:43,787 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 04:59:43,788 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 04:59:43,788 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 04:59:43,793 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 04:59:43,808 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:59:43,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:59:43 BoogieIcfgContainer [2022-04-08 04:59:43,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:59:43,818 INFO L158 Benchmark]: Toolchain (without parser) took 4086.82ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 153.3MB in the beginning and 193.7MB in the end (delta: -40.4MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. [2022-04-08 04:59:43,818 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:59:43,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.98ms. Allocated memory is still 200.3MB. Free memory was 153.0MB in the beginning and 177.9MB in the end (delta: -24.9MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-04-08 04:59:43,819 INFO L158 Benchmark]: Boogie Preprocessor took 21.94ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:59:43,819 INFO L158 Benchmark]: RCFGBuilder took 320.06ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 164.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:59:43,819 INFO L158 Benchmark]: TraceAbstraction took 3499.76ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 164.3MB in the beginning and 193.7MB in the end (delta: -29.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-08 04:59:43,821 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.11ms. Allocated memory is still 200.3MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.98ms. Allocated memory is still 200.3MB. Free memory was 153.0MB in the beginning and 177.9MB in the end (delta: -24.9MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.94ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 176.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 320.06ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 164.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3499.76ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 164.3MB in the beginning and 193.7MB in the end (delta: -29.3MB). Peak memory consumption was 12.4MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 103 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 74 PreInvPairs, 97 NumberOfFragments, 226 HoareAnnotationTreeSize, 74 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 99 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: 34]: Loop Invariant Derived loop invariant: (((((b == 1 && A == r) && 0 <= counter) && q == 0) || !(\old(counter) <= 0)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - 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 RESULT: Ultimate proved your program to be correct! [2022-04-08 04:59:43,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...