/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_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:08:13,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:08:13,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:08:13,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:08:13,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:08:13,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:08:13,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:08:13,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:08:13,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:08:13,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:08:13,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:08:13,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:08:13,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:08:13,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:08:13,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:08:13,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:08:13,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:08:13,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:08:13,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:08:13,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:08:13,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:08:13,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:08:13,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:08:13,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:08:13,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:08:13,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:08:13,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:08:13,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:08:13,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:08:13,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:08:13,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:08:13,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:08:13,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:08:13,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:08:13,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:08:13,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:08:13,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:08:13,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:08:13,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:08:13,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:08:13,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:08:13,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:08:13,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:08:13,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:08:13,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:08:13,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:08:13,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:08:13,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:08:13,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:08:13,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:08:13,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:08:13,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:08:13,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:08:13,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:08:13,143 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:08:13,144 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 08:08:13,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:08:13,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:08:13,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:08:13,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:08:13,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:08:13,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-15 08:08:13,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cc99ab3/e53146d6d2b4499ca59b13b59aeed985/FLAG578e385ba [2022-04-15 08:08:13,759 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:08:13,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-04-15 08:08:13,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cc99ab3/e53146d6d2b4499ca59b13b59aeed985/FLAG578e385ba [2022-04-15 08:08:13,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98cc99ab3/e53146d6d2b4499ca59b13b59aeed985 [2022-04-15 08:08:13,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:08:13,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:08:13,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:08:13,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:08:13,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:08:13,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:08:13" (1/1) ... [2022-04-15 08:08:13,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee9818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:13, skipping insertion in model container [2022-04-15 08:08:13,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:08:13" (1/1) ... [2022-04-15 08:08:13,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:08:13,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:08:13,963 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_unwindbound5.i[951,964] [2022-04-15 08:08:13,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:08:13,991 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:08:14,006 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_unwindbound5.i[951,964] [2022-04-15 08:08:14,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:08:14,029 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:08:14,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14 WrapperNode [2022-04-15 08:08:14,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:08:14,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:08:14,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:08:14,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:08:14,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:08:14,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:08:14,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:08:14,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:08:14,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (1/1) ... [2022-04-15 08:08:14,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:08:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:14,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 08:08:14,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:08:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:08:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:08:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:08:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:08:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:08:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:08:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:08:14,182 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:08:14,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:08:14,356 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:08:14,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:08:14,377 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:08:14,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:08:14 BoogieIcfgContainer [2022-04-15 08:08:14,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:08:14,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:08:14,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:08:14,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:08:14,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:08:13" (1/3) ... [2022-04-15 08:08:14,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef2dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:08:14, skipping insertion in model container [2022-04-15 08:08:14,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:08:14" (2/3) ... [2022-04-15 08:08:14,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef2dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:08:14, skipping insertion in model container [2022-04-15 08:08:14,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:08:14" (3/3) ... [2022-04-15 08:08:14,396 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2022-04-15 08:08:14,399 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:08:14,399 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:08:14,430 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:08:14,435 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:08:14,435 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:08:14,451 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-15 08:08:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 08:08:14,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:14,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:14,458 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-15 08:08:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:14,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560909642] [2022-04-15 08:08:14,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:08:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-15 08:08:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:14,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652318995] [2022-04-15 08:08:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:08:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:14,626 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-15 08:08:14,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:08:14,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:08:14,629 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-15 08:08:14,629 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-15 08:08:14,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:08:14,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:08:14,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-15 08:08:14,630 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-15 08:08:14,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 08:08:14,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-15 08:08:14,631 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-15 08:08:14,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 08:08:14,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 08:08:14,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 08:08:14,631 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-15 08:08:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652318995] [2022-04-15 08:08:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652318995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:14,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:14,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:14,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560909642] [2022-04-15 08:08:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560909642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:14,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:14,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820829943] [2022-04-15 08:08:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:14,639 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-15 08:08:14,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:14,642 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-15 08:08:14,654 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-15 08:08:14,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:08:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:14,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:08:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:08:14,670 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-15 08:08:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:14,787 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 08:08:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:08:14,787 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-15 08:08:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:14,789 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-15 08:08:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:08:14,798 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-15 08:08:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:08:14,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 08:08:14,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:14,883 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:08:14,883 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 08:08:14,885 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-15 08:08:14,890 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-15 08:08:14,892 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-15 08:08:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 08:08:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 08:08:14,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:14,919 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-15 08:08:14,919 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-15 08:08:14,920 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-15 08:08:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:14,924 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:08:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:08:14,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:14,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:14,926 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-15 08:08:14,926 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-15 08:08:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:14,928 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:08:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:08:14,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:14,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:14,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:14,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:14,930 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-15 08:08:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 08:08:14,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-15 08:08:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:14,936 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 08:08:14,936 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-15 08:08:14,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 08:08:14,963 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-15 08:08:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 08:08:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 08:08:14,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:14,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:14,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:08:14,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-15 08:08:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:14,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370865205] [2022-04-15 08:08:14,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:08:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-15 08:08:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:14,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806651051] [2022-04-15 08:08:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:08:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:15,039 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-15 08:08:15,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,041 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-15 08:08:15,042 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-15 08:08:15,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,043 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-15 08:08:15,044 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-15 08:08:15,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 5);havoc #t~post2; {212#false} is VALID [2022-04-15 08:08:15,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-15 08:08:15,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 5);havoc #t~post3; {212#false} is VALID [2022-04-15 08:08:15,045 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-15 08:08:15,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-15 08:08:15,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-15 08:08:15,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-15 08:08:15,045 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-15 08:08:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:15,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806651051] [2022-04-15 08:08:15,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806651051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:15,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:15,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:08:15,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:15,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370865205] [2022-04-15 08:08:15,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370865205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:15,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:15,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:08:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58576728] [2022-04-15 08:08:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:15,048 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-15 08:08:15,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:15,048 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-15 08:08:15,058 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-15 08:08:15,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:08:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:08:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:08:15,059 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-15 08:08:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,171 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 08:08:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:08:15,172 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-15 08:08:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:15,172 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-15 08:08:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:08:15,176 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-15 08:08:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:08:15,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 08:08:15,211 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-15 08:08:15,213 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:08:15,213 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 08:08:15,213 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-15 08:08:15,216 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-15 08:08:15,217 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-15 08:08:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 08:08:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 08:08:15,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:15,228 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-15 08:08:15,228 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-15 08:08:15,228 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-15 08:08:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,230 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:08:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:08:15,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:15,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:15,230 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-15 08:08:15,231 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-15 08:08:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,232 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:08:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:08:15,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:15,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:15,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:15,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:15,233 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-15 08:08:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 08:08:15,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-15 08:08:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:15,234 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 08:08:15,234 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-15 08:08:15,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 08:08:15,256 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-15 08:08:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:08:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:08:15,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:15,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:15,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 08:08:15,257 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-15 08:08:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:15,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368650302] [2022-04-15 08:08:15,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:08:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-15 08:08:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:15,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724725471] [2022-04-15 08:08:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:15,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:15,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810636975] [2022-04-15 08:08:15,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:15,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:15,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 08:08:15,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:08:15,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:15,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:08:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:15,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:15,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 08:08:15,510 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; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~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; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:15,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:15,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:15,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:15,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:08:15,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {386#false} is VALID [2022-04-15 08:08:15,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 08:08:15,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 08:08:15,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 08:08:15,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 08:08:15,515 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-15 08:08:15,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724725471] [2022-04-15 08:08:15,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810636975] [2022-04-15 08:08:15,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810636975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:15,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:15,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:15,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368650302] [2022-04-15 08:08:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368650302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198331247] [2022-04-15 08:08:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 08:08:15,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:15,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 08:08:15,532 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-15 08:08:15,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:08:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:15,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:08:15,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:08:15,533 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 08:08:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,626 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 08:08:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:08:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 08:08:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 08:08:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:08:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 08:08:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:08:15,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 08:08:15,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:15,655 INFO L225 Difference]: With dead ends: 34 [2022-04-15 08:08:15,655 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 08:08:15,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:08:15,656 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:15,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 08:08:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 08:08:15,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:15,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-15 08:08:15,664 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-15 08:08:15,665 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-15 08:08:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,670 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:08:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:08:15,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:15,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:15,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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 27 states. [2022-04-15 08:08:15,671 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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 27 states. [2022-04-15 08:08:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:15,672 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:08:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:08:15,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:15,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:15,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:15,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-15 08:08:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 08:08:15,674 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-15 08:08:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:15,674 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 08:08:15,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 08:08:15,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 08:08:15,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 08:08:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:08:15,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:15,698 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:15,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 08:08:15,911 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-15 08:08:15,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-15 08:08:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:15,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116434039] [2022-04-15 08:08:15,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:08:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-15 08:08:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:15,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624934249] [2022-04-15 08:08:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:15,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016339721] [2022-04-15 08:08:15,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:15,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:15,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:15,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 08:08:15,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:08:15,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:15,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:08:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:15,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:16,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-15 08:08:16,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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; {608#true} is VALID [2022-04-15 08:08:16,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 08:08:16,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-15 08:08:16,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-15 08:08:16,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#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; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(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-15 08:08:16,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(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; {638#(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-15 08:08:16,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(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 < 5);havoc #t~post3; {638#(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-15 08:08:16,185 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(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)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:08:16,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:08:16,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-15 08:08:16,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-15 08:08:16,186 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-15 08:08:16,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:16,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624934249] [2022-04-15 08:08:16,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016339721] [2022-04-15 08:08:16,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016339721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:16,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:16,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:08:16,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116434039] [2022-04-15 08:08:16,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116434039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:16,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:16,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:08:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440810442] [2022-04-15 08:08:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:16,188 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-15 08:08:16,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:16,188 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-15 08:08:16,201 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-15 08:08:16,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:08:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:08:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:08:16,202 INFO L87 Difference]: Start difference. First operand 26 states and 32 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-15 08:08:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:16,366 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 08:08:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:08:16,367 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-15 08:08:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:16,367 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-15 08:08:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:08:16,368 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-15 08:08:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:08:16,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 08:08:16,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:16,416 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:08:16,416 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:08:16,416 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-15 08:08:16,417 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:16,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:08:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:08:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:08:16,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:16,432 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-15 08:08:16,432 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-15 08:08:16,432 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-15 08:08:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:16,434 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:08:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:08:16,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:16,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:16,437 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-15 08:08:16,437 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-15 08:08:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:16,439 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:08:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:08:16,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:16,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:16,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:16,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:16,441 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-15 08:08:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:08:16,442 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-15 08:08:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:16,442 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:08:16,442 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-15 08:08:16,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:08:16,476 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-15 08:08:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:08:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 08:08:16,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:16,477 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:16,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:16,691 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-15 08:08:16,692 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-15 08:08:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:16,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196374058] [2022-04-15 08:08:16,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:16,710 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:16,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-15 08:08:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:16,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245622417] [2022-04-15 08:08:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:16,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:16,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277202077] [2022-04-15 08:08:16,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:16,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:16,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:16,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 08:08:16,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:08:16,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:16,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:08:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:16,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:16,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-15 08:08:16,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#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; {858#true} is VALID [2022-04-15 08:08:16,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-15 08:08:16,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-15 08:08:16,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-15 08:08:16,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#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; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 5);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 5);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 5);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:08:16,855 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(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)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:08:16,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:08:16,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-15 08:08:16,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-15 08:08:16,856 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-15 08:08:16,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:16,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245622417] [2022-04-15 08:08:16,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:16,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277202077] [2022-04-15 08:08:16,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277202077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:16,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:16,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:16,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196374058] [2022-04-15 08:08:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196374058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:16,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:16,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270520420] [2022-04-15 08:08:16,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:16,857 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-15 08:08:16,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:16,857 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-15 08:08:16,869 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-15 08:08:16,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:08:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:08:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:08:16,870 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-15 08:08:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:16,981 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 08:08:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:08:16,981 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-15 08:08:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:16,982 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-15 08:08:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:08:16,983 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-15 08:08:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:08:16,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 08:08:17,013 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-15 08:08:17,014 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:08:17,014 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 08:08:17,015 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-15 08:08:17,015 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-15 08:08:17,016 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-15 08:08:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 08:08:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-15 08:08:17,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:17,031 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-15 08:08:17,032 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-15 08:08:17,032 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-15 08:08:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:17,033 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:08:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:08:17,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:17,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:17,034 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-15 08:08:17,034 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-15 08:08:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:17,035 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:08:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:08:17,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:17,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:17,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:17,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:17,035 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-15 08:08:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:08:17,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-15 08:08:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:17,036 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:08:17,037 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-15 08:08:17,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:08:17,068 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-15 08:08:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:08:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 08:08:17,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:17,068 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-15 08:08:17,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:17,283 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-15 08:08:17,284 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-15 08:08:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553996637] [2022-04-15 08:08:17,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-15 08:08:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180926040] [2022-04-15 08:08:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:17,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:17,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504811204] [2022-04-15 08:08:17,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:17,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:17,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:17,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:17,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:08:17,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:17,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:17,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:08:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:17,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:17,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-15 08:08:17,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:17,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#(<= ~counter~0 0)} assume true; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:17,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#(<= ~counter~0 0)} {1149#true} #82#return; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:17,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#(<= ~counter~0 0)} call #t~ret4 := main(); {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:17,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#(<= ~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; {1157#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:17,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {1157#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:17,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:17,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1173#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:17,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,510 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(<= ~counter~0 2)} ~cond := #in~cond; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(<= ~counter~0 2)} assume !(0 == ~cond); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#(<= ~counter~0 2)} {1183#(<= ~counter~0 2)} #78#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1211#(<= |main_#t~post3| 2)} is VALID [2022-04-15 08:08:17,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(<= |main_#t~post3| 2)} assume !(#t~post3 < 5);havoc #t~post3; {1150#false} is VALID [2022-04-15 08:08:17,513 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-15 08:08:17,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-15 08:08:17,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-15 08:08:17,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-15 08:08:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:17,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:08:17,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-15 08:08:17,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-15 08:08:17,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-15 08:08:17,652 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-15 08:08:17,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {1150#false} is VALID [2022-04-15 08:08:17,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1239#(< |main_#t~post3| 5)} is VALID [2022-04-15 08:08:17,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1243#(< ~counter~0 5)} is VALID [2022-04-15 08:08:17,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#(< ~counter~0 5)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1243#(< ~counter~0 5)} is VALID [2022-04-15 08:08:17,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1243#(< ~counter~0 5)} #78#return; {1243#(< ~counter~0 5)} is VALID [2022-04-15 08:08:17,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-15 08:08:17,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-15 08:08:17,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-15 08:08:17,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-15 08:08:17,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1243#(< ~counter~0 5)} is VALID [2022-04-15 08:08:17,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1243#(< ~counter~0 5)} is VALID [2022-04-15 08:08:17,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(< ~counter~0 4)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1271#(< ~counter~0 4)} is VALID [2022-04-15 08:08:17,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(< ~counter~0 4)} assume !!(#t~post2 < 5);havoc #t~post2; {1271#(< ~counter~0 4)} is VALID [2022-04-15 08:08:17,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1183#(<= ~counter~0 2)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1271#(< ~counter~0 4)} is VALID [2022-04-15 08:08:17,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#(<= ~counter~0 2)} call #t~ret4 := main(); {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#(<= ~counter~0 2)} {1149#true} #82#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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; {1183#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:17,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-15 08:08:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180926040] [2022-04-15 08:08:17,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504811204] [2022-04-15 08:08:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504811204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:08:17,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:08:17,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 08:08:17,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553996637] [2022-04-15 08:08:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553996637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:17,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:17,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:08:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126681785] [2022-04-15 08:08:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:17,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:17,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:08:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:08:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:08:17,706 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:17,800 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 08:08:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:08:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 08:08:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 08:08:17,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-15 08:08:17,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:17,836 INFO L225 Difference]: With dead ends: 57 [2022-04-15 08:08:17,836 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 08:08:17,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:08:17,837 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:17,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 08:08:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-15 08:08:17,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:17,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:17,866 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:17,867 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:17,868 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-15 08:08:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-15 08:08:17,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:17,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:17,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-15 08:08:17,868 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-15 08:08:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:17,870 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-15 08:08:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-15 08:08:17,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:17,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:17,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:17,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-15 08:08:17,871 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-04-15 08:08:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:17,871 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-15 08:08:17,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 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-15 08:08:17,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-15 08:08:17,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 08:08:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 08:08:17,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:17,927 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:17,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:18,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:18,140 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-15 08:08:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99044984] [2022-04-15 08:08:18,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 2 times [2022-04-15 08:08:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859724737] [2022-04-15 08:08:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:18,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:18,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162134027] [2022-04-15 08:08:18,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:18,156 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:18,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:08:18,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:18,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:18,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:08:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:18,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:18,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-15 08:08:18,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#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; {1605#true} is VALID [2022-04-15 08:08:18,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 08:08:18,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #82#return; {1605#true} is VALID [2022-04-15 08:08:18,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret4 := main(); {1605#true} is VALID [2022-04-15 08:08:18,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#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; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 5);havoc #t~post2; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 5);havoc #t~post3; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,281 INFO L272 TraceCheckUtils]: 11: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1605#true} is VALID [2022-04-15 08:08:18,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 08:08:18,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 08:08:18,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 08:08:18,282 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#true} {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:18,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1606#false} is VALID [2022-04-15 08:08:18,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {1606#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1606#false} is VALID [2022-04-15 08:08:18,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1606#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1606#false} is VALID [2022-04-15 08:08:18,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {1606#false} assume !!(#t~post3 < 5);havoc #t~post3; {1606#false} is VALID [2022-04-15 08:08:18,282 INFO L272 TraceCheckUtils]: 20: Hoare triple {1606#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1606#false} is VALID [2022-04-15 08:08:18,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {1606#false} ~cond := #in~cond; {1606#false} is VALID [2022-04-15 08:08:18,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1606#false} assume 0 == ~cond; {1606#false} is VALID [2022-04-15 08:08:18,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-15 08:08:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:18,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859724737] [2022-04-15 08:08:18,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162134027] [2022-04-15 08:08:18,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162134027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:18,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:18,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:18,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99044984] [2022-04-15 08:08:18,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99044984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:18,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:18,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661039688] [2022-04-15 08:08:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:08:18,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:18,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:18,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:18,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:08:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:08:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:08:18,301 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:18,373 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-15 08:08:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:08:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:08:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:08:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:08:18,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 08:08:18,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:18,405 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:08:18,405 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 08:08:18,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:08:18,406 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:18,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 08:08:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 08:08:18,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:18,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-15 08:08:18,422 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-15 08:08:18,422 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-15 08:08:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:18,423 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:08:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:18,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:18,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:18,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 33 states. [2022-04-15 08:08:18,423 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 33 states. [2022-04-15 08:08:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:18,424 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:08:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:18,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:18,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:18,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:18,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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-15 08:08:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-15 08:08:18,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-15 08:08:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:18,426 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-15 08:08:18,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:18,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-15 08:08:18,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:08:18,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:18,463 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:18,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 08:08:18,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:18,670 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-15 08:08:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:18,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590902947] [2022-04-15 08:08:18,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:18,679 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:18,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-15 08:08:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:18,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297966379] [2022-04-15 08:08:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:18,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:18,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299474756] [2022-04-15 08:08:18,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:18,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:18,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:08:18,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:18,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:18,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:08:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:18,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2022-04-15 08:08:18,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1941#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; {1949#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:18,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {1949#(<= ~counter~0 0)} assume true; {1949#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:18,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1949#(<= ~counter~0 0)} {1941#true} #82#return; {1949#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:18,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1949#(<= ~counter~0 0)} call #t~ret4 := main(); {1949#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:18,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1949#(<= ~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; {1949#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:18,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1965#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:18,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1965#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {1965#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:18,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1965#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1965#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:18,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1965#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1975#(<= |main_#t~post2| 1)} is VALID [2022-04-15 08:08:18,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {1975#(<= |main_#t~post2| 1)} assume !(#t~post2 < 5);havoc #t~post2; {1942#false} is VALID [2022-04-15 08:08:18,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#false} assume !!(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L272 TraceCheckUtils]: 13: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#false} assume !(0 == ~cond); {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#false} assume true; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1942#false} {1942#false} #78#return; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#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); {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {1942#false} assume !(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2022-04-15 08:08:18,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2022-04-15 08:08:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:08:18,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L272 TraceCheckUtils]: 22: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1942#false} assume !(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1942#false} is VALID [2022-04-15 08:08:18,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#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); {1942#false} is VALID [2022-04-15 08:08:18,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1941#true} {1942#false} #78#return; {1942#false} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {1941#true} assume true; {1941#true} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1941#true} assume !(0 == ~cond); {1941#true} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1941#true} ~cond := #in~cond; {1941#true} is VALID [2022-04-15 08:08:18,953 INFO L272 TraceCheckUtils]: 13: Hoare triple {1942#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1941#true} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#false} assume !!(#t~post3 < 5);havoc #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1942#false} is VALID [2022-04-15 08:08:18,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#(< |main_#t~post2| 5)} assume !(#t~post2 < 5);havoc #t~post2; {1942#false} is VALID [2022-04-15 08:08:18,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {2073#(< ~counter~0 5)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2069#(< |main_#t~post2| 5)} is VALID [2022-04-15 08:08:18,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2073#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2073#(< ~counter~0 5)} is VALID [2022-04-15 08:08:18,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2073#(< ~counter~0 5)} assume !!(#t~post2 < 5);havoc #t~post2; {2073#(< ~counter~0 5)} is VALID [2022-04-15 08:08:18,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {2083#(< ~counter~0 4)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2073#(< ~counter~0 5)} is VALID [2022-04-15 08:08:18,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {2083#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2083#(< ~counter~0 4)} is VALID [2022-04-15 08:08:18,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {2083#(< ~counter~0 4)} call #t~ret4 := main(); {2083#(< ~counter~0 4)} is VALID [2022-04-15 08:08:18,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2083#(< ~counter~0 4)} {1941#true} #82#return; {2083#(< ~counter~0 4)} is VALID [2022-04-15 08:08:18,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2083#(< ~counter~0 4)} assume true; {2083#(< ~counter~0 4)} is VALID [2022-04-15 08:08:18,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1941#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; {2083#(< ~counter~0 4)} is VALID [2022-04-15 08:08:18,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2022-04-15 08:08:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:08:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:18,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297966379] [2022-04-15 08:08:18,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:18,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299474756] [2022-04-15 08:08:18,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299474756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:08:18,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:08:18,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 08:08:18,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:18,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590902947] [2022-04-15 08:08:18,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590902947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:18,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:18,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829929787] [2022-04-15 08:08:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2022-04-15 08:08:18,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:18,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-15 08:08:18,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:18,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:08:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:08:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 08:08:18,980 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-15 08:08:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,040 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-15 08:08:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:08:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2022-04-15 08:08:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-15 08:08:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:08:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-15 08:08:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:08:19,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-15 08:08:19,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:19,070 INFO L225 Difference]: With dead ends: 56 [2022-04-15 08:08:19,070 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 08:08:19,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:08:19,070 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:19,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 08:08:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 08:08:19,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:19,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-15 08:08:19,100 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-15 08:08:19,102 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-15 08:08:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,103 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:08:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:19,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:19,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2022-04-15 08:08:19,105 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2022-04-15 08:08:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,106 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:08:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:19,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:19,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:19,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:19,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-15 08:08:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-15 08:08:19,107 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-15 08:08:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:19,108 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-15 08:08:19,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-15 08:08:19,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-15 08:08:19,141 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-15 08:08:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 08:08:19,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:19,142 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:19,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 08:08:19,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:19,355 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-15 08:08:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:19,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63427596] [2022-04-15 08:08:19,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:19,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:19,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-15 08:08:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:19,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472702957] [2022-04-15 08:08:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:19,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:19,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165786816] [2022-04-15 08:08:19,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:19,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:19,385 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:19,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 08:08:19,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:19,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:19,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:08:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:19,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:19,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2022-04-15 08:08:19,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2358#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; {2366#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:19,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {2366#(<= ~counter~0 0)} assume true; {2366#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:19,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2366#(<= ~counter~0 0)} {2358#true} #82#return; {2366#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:19,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {2366#(<= ~counter~0 0)} call #t~ret4 := main(); {2366#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:19,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {2366#(<= ~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; {2366#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:19,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {2366#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {2382#(<= ~counter~0 1)} assume !!(#t~post2 < 5);havoc #t~post2; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {2392#(<= ~counter~0 2)} assume !!(#t~post2 < 5);havoc #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {2392#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {2392#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {2402#(<= ~counter~0 3)} assume !!(#t~post3 < 5);havoc #t~post3; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,572 INFO L272 TraceCheckUtils]: 14: Hoare triple {2402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {2402#(<= ~counter~0 3)} ~cond := #in~cond; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {2402#(<= ~counter~0 3)} assume !(0 == ~cond); {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#(<= ~counter~0 3)} assume true; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,573 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2402#(<= ~counter~0 3)} {2402#(<= ~counter~0 3)} #78#return; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {2402#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {2402#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {2402#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2430#(<= |main_#t~post3| 3)} is VALID [2022-04-15 08:08:19,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {2430#(<= |main_#t~post3| 3)} assume !(#t~post3 < 5);havoc #t~post3; {2359#false} is VALID [2022-04-15 08:08:19,574 INFO L272 TraceCheckUtils]: 23: Hoare triple {2359#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#false} is VALID [2022-04-15 08:08:19,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2022-04-15 08:08:19,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#false} assume 0 == ~cond; {2359#false} is VALID [2022-04-15 08:08:19,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2022-04-15 08:08:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:19,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:08:19,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2022-04-15 08:08:19,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#false} assume 0 == ~cond; {2359#false} is VALID [2022-04-15 08:08:19,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2022-04-15 08:08:19,722 INFO L272 TraceCheckUtils]: 23: Hoare triple {2359#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#false} is VALID [2022-04-15 08:08:19,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {2359#false} is VALID [2022-04-15 08:08:19,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {2462#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2458#(< |main_#t~post3| 5)} is VALID [2022-04-15 08:08:19,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {2462#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2462#(< ~counter~0 5)} is VALID [2022-04-15 08:08:19,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {2462#(< ~counter~0 5)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2462#(< ~counter~0 5)} is VALID [2022-04-15 08:08:19,723 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2358#true} {2462#(< ~counter~0 5)} #78#return; {2462#(< ~counter~0 5)} is VALID [2022-04-15 08:08:19,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {2358#true} assume true; {2358#true} is VALID [2022-04-15 08:08:19,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2358#true} assume !(0 == ~cond); {2358#true} is VALID [2022-04-15 08:08:19,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2358#true} ~cond := #in~cond; {2358#true} is VALID [2022-04-15 08:08:19,724 INFO L272 TraceCheckUtils]: 14: Hoare triple {2462#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2358#true} is VALID [2022-04-15 08:08:19,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {2462#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {2462#(< ~counter~0 5)} is VALID [2022-04-15 08:08:19,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {2402#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2462#(< ~counter~0 5)} is VALID [2022-04-15 08:08:19,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#(<= ~counter~0 3)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#(<= ~counter~0 3)} assume !!(#t~post2 < 5);havoc #t~post2; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {2392#(<= ~counter~0 2)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2402#(<= ~counter~0 3)} is VALID [2022-04-15 08:08:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2392#(<= ~counter~0 2)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {2392#(<= ~counter~0 2)} assume !!(#t~post2 < 5);havoc #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {2382#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2392#(<= ~counter~0 2)} is VALID [2022-04-15 08:08:19,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2382#(<= ~counter~0 1)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {2382#(<= ~counter~0 1)} call #t~ret4 := main(); {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2382#(<= ~counter~0 1)} {2358#true} #82#return; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2382#(<= ~counter~0 1)} assume true; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2358#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; {2382#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:19,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2022-04-15 08:08:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:19,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472702957] [2022-04-15 08:08:19,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165786816] [2022-04-15 08:08:19,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165786816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:08:19,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:08:19,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 08:08:19,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63427596] [2022-04-15 08:08:19,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63427596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:19,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:19,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:08:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009632478] [2022-04-15 08:08:19,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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 27 [2022-04-15 08:08:19,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:19,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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-15 08:08:19,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:19,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:08:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:08:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 08:08:19,756 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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-15 08:08:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,873 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-15 08:08:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:08:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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 27 [2022-04-15 08:08:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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-15 08:08:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 08:08:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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-15 08:08:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 08:08:19,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-15 08:08:19,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:19,918 INFO L225 Difference]: With dead ends: 60 [2022-04-15 08:08:19,918 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 08:08:19,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:08:19,919 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:19,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 08:08:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-04-15 08:08:19,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:19,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:19,976 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,983 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-15 08:08:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-15 08:08:19,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:19,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:19,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-15 08:08:19,984 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-15 08:08:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:19,986 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-15 08:08:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-15 08:08:19,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:19,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:19,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:19,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:08:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-15 08:08:19,988 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 27 [2022-04-15 08:08:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:19,988 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-15 08:08:19,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 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-15 08:08:19,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2022-04-15 08:08:20,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 08:08:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 08:08:20,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:20,061 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:20,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 08:08:20,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:20,279 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-15 08:08:20,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:20,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465904979] [2022-04-15 08:08:20,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:20,286 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:20,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 2 times [2022-04-15 08:08:20,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:20,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358457847] [2022-04-15 08:08:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:20,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:20,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251690783] [2022-04-15 08:08:20,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:20,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:20,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:20,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:20,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process