/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/loop-industry-pattern/mod3.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:25:03,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:25:03,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:25:03,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:25:03,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:25:03,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:25:03,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:25:03,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:25:03,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:25:03,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:25:03,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:25:03,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:25:03,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:25:03,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:25:03,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:25:03,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:25:03,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:25:03,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:25:03,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:25:03,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:25:03,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:25:03,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:25:03,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:25:03,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:25:03,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:25:03,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:25:03,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:25:03,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:25:03,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:25:03,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:25:03,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:25:03,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:25:03,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:25:03,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:25:03,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:25:03,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:25:03,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:25:03,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:25:03,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:25:03,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:25:03,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:25:03,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:25:03,790 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 06:25:03,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:25:03,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:25:03,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:25:03,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:25:03,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:25:03,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:25:03,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:25:03,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:25:03,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:25:03,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:25:03,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:25:03,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:25:03,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:25:03,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:25:03,802 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:25:03,803 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 06:25:04,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:25:04,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:25:04,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:25:04,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:25:04,031 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:25:04,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-15 06:25:04,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfebfe6/0e0d3e69d2ee4f9d96a0fb67a66aa58b/FLAGefc220a4f [2022-04-15 06:25:04,446 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:25:04,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-15 06:25:04,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfebfe6/0e0d3e69d2ee4f9d96a0fb67a66aa58b/FLAGefc220a4f [2022-04-15 06:25:04,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfebfe6/0e0d3e69d2ee4f9d96a0fb67a66aa58b [2022-04-15 06:25:04,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:25:04,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:25:04,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:25:04,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:25:04,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:25:04,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:25:04" (1/1) ... [2022-04-15 06:25:04,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e706d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:04, skipping insertion in model container [2022-04-15 06:25:04,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:25:04" (1/1) ... [2022-04-15 06:25:04,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:25:04,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:25:05,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-15 06:25:05,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:25:05,063 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:25:05,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-15 06:25:05,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:25:05,098 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:25:05,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05 WrapperNode [2022-04-15 06:25:05,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:25:05,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:25:05,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:25:05,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:25:05,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:25:05,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:25:05,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:25:05,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:25:05,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (1/1) ... [2022-04-15 06:25:05,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:25:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:25:05,175 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 06:25:05,176 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 06:25:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:25:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:25:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:25:05,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:25:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:25:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:25:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:25:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:25:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:25:05,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:25:05,279 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:25:05,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:25:14,109 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:25:14,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:25:14,115 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 06:25:14,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:25:14 BoogieIcfgContainer [2022-04-15 06:25:14,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:25:14,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:25:14,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:25:14,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:25:14,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:25:04" (1/3) ... [2022-04-15 06:25:14,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a102da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:25:14, skipping insertion in model container [2022-04-15 06:25:14,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:25:05" (2/3) ... [2022-04-15 06:25:14,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a102da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:25:14, skipping insertion in model container [2022-04-15 06:25:14,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:25:14" (3/3) ... [2022-04-15 06:25:14,123 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.c [2022-04-15 06:25:14,127 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:25:14,127 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:25:14,159 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:25:14,165 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 06:25:14,165 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:25:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:25:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:25:14,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:25:14,187 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:25:14,187 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:25:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:25:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 1 times [2022-04-15 06:25:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:25:14,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089844139] [2022-04-15 06:25:14,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:25:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 2 times [2022-04-15 06:25:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:25:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676971610] [2022-04-15 06:25:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:25:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:25:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:25:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:25:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:25:14,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-15 06:25:14,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 06:25:14,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-15 06:25:14,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:25:14,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-15 06:25:14,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 06:25:14,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-15 06:25:14,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-15 06:25:14,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 06:25:14,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 06:25:14,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 06:25:16,943 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 06:25:16,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:25:16,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:25:16,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:25:16,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:25:16,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {32#false} is VALID [2022-04-15 06:25:16,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-15 06:25:16,970 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 06:25:16,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:25:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676971610] [2022-04-15 06:25:16,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676971610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:25:16,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:25:16,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:25:16,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:25:16,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089844139] [2022-04-15 06:25:16,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089844139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:25:16,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:25:16,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:25:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965034268] [2022-04-15 06:25:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:25:16,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 06:25:16,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:25:16,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:25:19,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:25:19,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:25:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:25:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:25:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:25:19,171 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:25:21,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:23,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:25,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:27,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:30,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:36,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:38,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:43,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:45,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:52,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:56,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:25:58,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:00,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:00,990 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-15 06:26:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:26:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 06:26:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 06:26:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 06:26:01,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-15 06:26:03,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:03,275 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:26:03,275 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:26:03,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:26:03,281 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:03,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 27.9s Time] [2022-04-15 06:26:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:26:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 06:26:03,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:03,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:03,320 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:03,320 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:03,324 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 06:26:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 06:26:03,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:03,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:03,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:26:03,326 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:26:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:03,329 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 06:26:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 06:26:03,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:03,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:03,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:03,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-15 06:26:03,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-15 06:26:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:03,339 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-15 06:26:03,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:03,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2022-04-15 06:26:05,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 06:26:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:26:05,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:05,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:05,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:26:05,539 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 1 times [2022-04-15 06:26:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:05,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484362734] [2022-04-15 06:26:05,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:26:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 2 times [2022-04-15 06:26:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:05,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549346024] [2022-04-15 06:26:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:05,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {322#true} is VALID [2022-04-15 06:26:05,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-15 06:26:05,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-15 06:26:05,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {330#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:05,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {322#true} is VALID [2022-04-15 06:26:05,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-15 06:26:05,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-15 06:26:05,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret9 := main(); {322#true} is VALID [2022-04-15 06:26:05,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {322#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 06:26:05,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 06:26:05,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 06:26:05,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 06:26:08,015 WARN L290 TraceCheckUtils]: 9: Hoare triple {327#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 06:26:08,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:26:08,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:26:08,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:26:08,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {329#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:26:08,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {323#false} is VALID [2022-04-15 06:26:08,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#false} assume !false; {323#false} is VALID [2022-04-15 06:26:08,024 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 06:26:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:08,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549346024] [2022-04-15 06:26:08,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549346024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:08,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:26:08,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484362734] [2022-04-15 06:26:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484362734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:08,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:26:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408178892] [2022-04-15 06:26:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:26:08,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:08,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:10,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:10,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:26:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:26:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:26:10,182 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:14,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:16,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:18,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:23,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:25,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:27,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:34,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:36,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:38,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:40,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:43,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:49,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:51,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:53,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:26:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:54,136 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-15 06:26:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:26:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:26:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 06:26:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 06:26:54,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-15 06:26:56,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:56,371 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:26:56,371 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:26:56,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:26:56,372 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:56,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 29.7s Time] [2022-04-15 06:26:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:26:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-15 06:26:56,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:56,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:56,429 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:56,429 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:56,431 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 06:26:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 06:26:56,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:56,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:56,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:26:56,433 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:26:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:56,435 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 06:26:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 06:26:56,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:56,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:56,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:56,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 06:26:56,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-15 06:26:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:56,448 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 06:26:56,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:56,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 06:27:00,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 06:27:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:27:00,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:00,786 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:00,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:27:00,787 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 1 times [2022-04-15 06:27:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1749354364] [2022-04-15 06:27:00,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:27:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 2 times [2022-04-15 06:27:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:00,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131172324] [2022-04-15 06:27:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:01,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {605#true} is VALID [2022-04-15 06:27:01,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-15 06:27:01,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #72#return; {605#true} is VALID [2022-04-15 06:27:01,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {612#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:01,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {605#true} is VALID [2022-04-15 06:27:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-15 06:27:01,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #72#return; {605#true} is VALID [2022-04-15 06:27:01,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret9 := main(); {605#true} is VALID [2022-04-15 06:27:01,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {605#true} is VALID [2022-04-15 06:27:01,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {605#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-15 06:27:01,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {605#true} is VALID [2022-04-15 06:27:01,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {605#true} is VALID [2022-04-15 06:27:01,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {605#true} is VALID [2022-04-15 06:27:01,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {605#true} is VALID [2022-04-15 06:27:01,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {605#true} is VALID [2022-04-15 06:27:01,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {605#true} is VALID [2022-04-15 06:27:01,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {605#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {605#true} is VALID [2022-04-15 06:27:03,197 WARN L290 TraceCheckUtils]: 14: Hoare triple {605#true} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 06:27:03,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:27:03,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:27:03,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:27:03,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {610#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {611#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:27:03,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {611#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {606#false} is VALID [2022-04-15 06:27:03,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-15 06:27:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:27:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:03,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131172324] [2022-04-15 06:27:03,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131172324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:03,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:03,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:27:03,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:03,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1749354364] [2022-04-15 06:27:03,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1749354364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:03,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:03,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:27:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882105408] [2022-04-15 06:27:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:27:03,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:03,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:05,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:05,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:27:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:27:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:27:05,393 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:09,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:11,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:16,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:20,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:22,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:24,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:27,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:29,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:33,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:38,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:40,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:44,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:53,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:27:57,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:02,029 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 06:28:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:28:02,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:28:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 06:28:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 06:28:02,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-15 06:28:06,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:06,491 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:28:06,491 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:28:06,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:28:06,492 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:06,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 29.3s Time] [2022-04-15 06:28:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:28:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-15 06:28:06,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:06,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:06,533 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:06,534 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:06,540 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 06:28:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 06:28:06,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:06,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:06,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:28:06,547 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:28:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:06,557 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 06:28:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 06:28:06,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:06,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:06,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:06,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 06:28:06,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-15 06:28:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:06,576 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 06:28:06,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:06,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-15 06:28:13,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 06:28:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:28:13,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:13,058 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:13,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:28:13,059 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 1 times [2022-04-15 06:28:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846582069] [2022-04-15 06:28:13,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:28:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 2 times [2022-04-15 06:28:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:13,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99318321] [2022-04-15 06:28:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:13,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {905#true} is VALID [2022-04-15 06:28:13,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-15 06:28:13,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {905#true} {905#true} #72#return; {905#true} is VALID [2022-04-15 06:28:13,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {912#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:13,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {905#true} is VALID [2022-04-15 06:28:13,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#true} assume true; {905#true} is VALID [2022-04-15 06:28:13,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#true} {905#true} #72#return; {905#true} is VALID [2022-04-15 06:28:13,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#true} call #t~ret9 := main(); {905#true} is VALID [2022-04-15 06:28:13,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {905#true} is VALID [2022-04-15 06:28:13,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {905#true} is VALID [2022-04-15 06:28:13,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {905#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {905#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {905#true} is VALID [2022-04-15 06:28:13,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {905#true} is VALID [2022-04-15 06:28:13,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {905#true} is VALID [2022-04-15 06:28:15,384 WARN L290 TraceCheckUtils]: 15: Hoare triple {905#true} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 06:28:15,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:28:15,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:28:15,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:28:15,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {910#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {911#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 06:28:15,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {911#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {906#false} is VALID [2022-04-15 06:28:15,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#false} assume !false; {906#false} is VALID [2022-04-15 06:28:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:28:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99318321] [2022-04-15 06:28:15,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99318321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:15,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:15,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:28:15,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846582069] [2022-04-15 06:28:15,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846582069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:15,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:15,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:28:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716707490] [2022-04-15 06:28:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:28:15,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:15,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:17,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:17,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:28:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:28:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:28:17,582 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:23,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:26,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:28,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:32,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:36,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:28:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:39,530 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-15 06:28:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:28:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:28:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 06:28:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 06:28:39,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 06:28:43,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:43,941 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:28:43,941 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:28:43,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 06:28:43,942 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:43,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-15 06:28:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:28:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:28:43,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:43,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:28:43,944 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:28:43,944 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:28:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:43,944 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:28:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:28:43,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:43,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:43,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:28:43,945 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:28:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:43,945 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:28:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:28:43,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:43,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:43,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:43,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:28:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:28:43,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-15 06:28:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:43,946 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:28:43,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:43,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:28:43,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:28:43,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:43,948 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:28:43,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:28:43,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:28:44,080 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-15 06:28:44,080 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-15 06:28:44,080 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-15 06:28:44,080 INFO L878 garLoopResultBuilder]: At program point L97(lines 97 106) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296))))))) [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L122(lines 25 145) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,081 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 151) the Hoare annotation is: true [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L56(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,081 INFO L885 garLoopResultBuilder]: At program point L23(lines 23 150) the Hoare annotation is: true [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L48(lines 48 85) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L44(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L90(lines 90 112) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,081 INFO L878 garLoopResultBuilder]: At program point L37(lines 37 113) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,082 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: false [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point L128(lines 128 143) the Hoare annotation is: true [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point L62(lines 62 84) the Hoare annotation is: true [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point L25(lines 25 145) the Hoare annotation is: true [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 151) the Hoare annotation is: true [2022-04-15 06:28:44,082 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) the Hoare annotation is: false [2022-04-15 06:28:44,082 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 151) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|)) [2022-04-15 06:28:44,082 INFO L885 garLoopResultBuilder]: At program point L117(lines 117 144) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 86) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,083 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:28:44,086 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-15 06:28:44,087 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:28:44,092 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:28:44,093 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:28:48,423 INFO L163 areAnnotationChecker]: CFG has 37 edges. 35 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:28:48,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:28:48 BoogieIcfgContainer [2022-04-15 06:28:48,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:28:48,433 INFO L158 Benchmark]: Toolchain (without parser) took 223568.33ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 126.8MB in the beginning and 91.1MB in the end (delta: 35.7MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. [2022-04-15 06:28:48,433 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:28:48,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 182.5MB. Free memory was 126.7MB in the beginning and 156.8MB in the end (delta: -30.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-15 06:28:48,433 INFO L158 Benchmark]: Boogie Preprocessor took 45.20ms. Allocated memory is still 182.5MB. Free memory was 156.8MB in the beginning and 155.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:28:48,434 INFO L158 Benchmark]: RCFGBuilder took 8971.42ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 142.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 06:28:48,434 INFO L158 Benchmark]: TraceAbstraction took 214313.68ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 141.6MB in the beginning and 91.1MB in the end (delta: 50.5MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. [2022-04-15 06:28:48,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 182.5MB. Free memory was 126.7MB in the beginning and 156.8MB in the end (delta: -30.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.20ms. Allocated memory is still 182.5MB. Free memory was 156.8MB in the beginning and 155.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8971.42ms. Allocated memory is still 182.5MB. Free memory was 155.2MB in the beginning and 142.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 214313.68ms. Allocated memory was 182.5MB in the beginning and 260.0MB in the end (delta: 77.6MB). Free memory was 141.6MB in the beginning and 91.1MB in the end (delta: 50.5MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 99]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 209.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 177.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 97.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 92.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 62 NumberOfFragments, 410 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:28:48,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...