/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-34549b5 [2022-04-08 04:04:05,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:04:05,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:04:05,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:04:05,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:04:05,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:04:05,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:04:05,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:04:05,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:04:05,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:04:05,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:04:05,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:04:05,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:04:05,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:04:05,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:04:05,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:04:05,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:04:05,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:04:05,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:04:05,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:04:05,559 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:04:05,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:04:05,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:04:05,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:04:05,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:04:05,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:04:05,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:04:05,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:04:05,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:04:05,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:04:05,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:04:05,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:04:05,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:04:05,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:04:05,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:04:05,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:04:05,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:04:05,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:04:05,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:04:05,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:04:05,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:04:05,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:04:05,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:04:05,581 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:04:05,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:04:05,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:04:05,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:04:05,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:04:05,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:04:05,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:04:05,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:04:05,586 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:04:05,586 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:04:05,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:04:05,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:04:05,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:04:05,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:04:05,825 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:04:05,825 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-08 04:04:05,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91df75b4/d9876531c32446b0843098cf4139ae1c/FLAG488dbe1a1 [2022-04-08 04:04:06,227 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:04:06,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-08 04:04:06,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91df75b4/d9876531c32446b0843098cf4139ae1c/FLAG488dbe1a1 [2022-04-08 04:04:06,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91df75b4/d9876531c32446b0843098cf4139ae1c [2022-04-08 04:04:06,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:04:06,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:04:06,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:04:06,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:04:06,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:04:06,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c476c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06, skipping insertion in model container [2022-04-08 04:04:06,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:04:06,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:04:06,886 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-08 04:04:06,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:04:06,917 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:04:06,944 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-08 04:04:06,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:04:06,959 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:04:06,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06 WrapperNode [2022-04-08 04:04:06,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:04:06,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:04:06,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:04:06,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:04:06,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:04:06,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:04:06,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:04:06,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:04:06,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (1/1) ... [2022-04-08 04:04:06,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:04:07,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:04:07,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:04:07,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:04:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:04:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:04:07,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:04:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:04:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:04:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:04:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:04:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:04:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:04:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:04:07,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:04:07,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:04:15,929 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:04:15,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:04:15,935 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 04:04:15,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:04:15 BoogieIcfgContainer [2022-04-08 04:04:15,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:04:15,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:04:15,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:04:15,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:04:15,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:04:06" (1/3) ... [2022-04-08 04:04:15,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff9cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:04:15, skipping insertion in model container [2022-04-08 04:04:15,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:04:06" (2/3) ... [2022-04-08 04:04:15,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff9cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:04:15, skipping insertion in model container [2022-04-08 04:04:15,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:04:15" (3/3) ... [2022-04-08 04:04:15,951 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.c [2022-04-08 04:04:15,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:04:15,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:04:15,986 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:04:15,991 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:04:15,991 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:04:16,005 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-08 04:04:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:04:16,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:04:16,011 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:04:16,012 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:04:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:04:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 1 times [2022-04-08 04:04:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:16,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063811024] [2022-04-08 04:04:16,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:04:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 2 times [2022-04-08 04:04:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:04:16,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543231147] [2022-04-08 04:04:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:04:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:04:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:04:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:04:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:04:16,738 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-08 04:04:16,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:04:16,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-08 04:04:16,743 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-08 04:04:16,743 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-08 04:04:16,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:04:16,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-08 04:04:16,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-08 04:04:16,745 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-08 04:04:16,746 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-08 04:04:16,747 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-08 04:04:18,858 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-08 04:04:18,860 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-08 04:04:18,862 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-08 04:04:18,863 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-08 04:04:18,872 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-08 04:04:18,873 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-08 04:04:18,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 04:04:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:04:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:04:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543231147] [2022-04-08 04:04:18,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543231147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:04:18,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:04:18,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:04:18,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:04:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063811024] [2022-04-08 04:04:18,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063811024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:04:18,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:04:18,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:04:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614017636] [2022-04-08 04:04:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:04:18,884 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-08 04:04:18,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:04:18,889 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-08 04:04:21,079 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-08 04:04:21,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:04:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:21,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:04:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:04:21,107 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-08 04:04:23,378 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-08 04:04:27,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-08 04:04:29,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:04:32,054 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-08 04:04:34,225 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-08 04:04:43,132 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-08 04:04:45,295 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-08 04:04:49,657 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-08 04:04:51,828 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-08 04:04:58,380 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-08 04:05:00,542 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-08 04:05:02,717 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-08 04:05:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:07,332 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-08 04:05:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:05:07,332 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-08 04:05:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:05:07,334 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-08 04:05:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-08 04:05:07,344 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-08 04:05:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-08 04:05:07,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-08 04:05:09,626 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-08 04:05:09,636 INFO L225 Difference]: With dead ends: 71 [2022-04-08 04:05:09,636 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 04:05:09,639 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-08 04:05:09,641 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.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, 80 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:05:09,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 12 Unknown, 0 Unchecked, 25.9s Time] [2022-04-08 04:05:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 04:05:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-08 04:05:09,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:05:09,690 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-08 04:05:09,690 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-08 04:05:09,691 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-08 04:05:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:09,694 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-08 04:05:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-08 04:05:09,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:09,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:09,695 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-08 04:05:09,696 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-08 04:05:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:09,699 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-08 04:05:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-08 04:05:09,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:09,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:09,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:05:09,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:05:09,700 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-08 04:05:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-08 04:05:09,703 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-08 04:05:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:05:09,703 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-08 04:05:09,703 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-08 04:05:09,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2022-04-08 04:05:11,890 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-08 04:05:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 04:05:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:05:11,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:05:11,891 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:05:11,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:05:11,891 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:05:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:05:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 1 times [2022-04-08 04:05:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866135538] [2022-04-08 04:05:11,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:05:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 2 times [2022-04-08 04:05:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:05:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432604262] [2022-04-08 04:05:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:05:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:05:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:05:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:05:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:05:12,223 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-08 04:05:12,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-08 04:05:12,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-08 04:05:12,225 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-08 04:05:12,225 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-08 04:05:12,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {322#true} assume true; {322#true} is VALID [2022-04-08 04:05:12,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {322#true} {322#true} #72#return; {322#true} is VALID [2022-04-08 04:05:12,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {322#true} call #t~ret9 := main(); {322#true} is VALID [2022-04-08 04:05:12,227 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-08 04:05:12,228 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-08 04:05:12,229 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-08 04:05:12,230 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-08 04:05:14,383 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-08 04:05:14,384 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-08 04:05:14,385 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-08 04:05:14,385 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-08 04:05:14,390 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-08 04:05:14,391 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-08 04:05:14,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#false} assume !false; {323#false} is VALID [2022-04-08 04:05:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:05:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:05:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432604262] [2022-04-08 04:05:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432604262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:05:14,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:05:14,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:05:14,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:05:14,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866135538] [2022-04-08 04:05:14,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866135538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:05:14,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:05:14,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:05:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825267450] [2022-04-08 04:05:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:05:14,393 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-08 04:05:14,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:05:14,394 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-08 04:05:16,545 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-08 04:05:16,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:05:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:05:16,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:05:16,547 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-08 04:05:25,250 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-08 04:05:29,582 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-08 04:05:31,800 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-08 04:05:38,705 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-08 04:05:40,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:05:43,067 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-08 04:05:45,234 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-08 04:05:53,836 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-08 04:05:56,004 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-08 04:05:58,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:06:00,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:06:02,537 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-08 04:06:11,201 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-08 04:06:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:15,778 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-08 04:06:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:06:15,778 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-08 04:06:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:06:15,779 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-08 04:06:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-08 04:06:15,781 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-08 04:06:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-08 04:06:15,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-08 04:06:17,998 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-08 04:06:18,000 INFO L225 Difference]: With dead ends: 60 [2022-04-08 04:06:18,000 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 04:06:18,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:06:18,002 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:06:18,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 28.1s Time] [2022-04-08 04:06:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 04:06:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-08 04:06:18,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:06:18,038 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-08 04:06:18,038 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-08 04:06:18,039 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-08 04:06:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:18,041 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 04:06:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 04:06:18,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:18,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:18,042 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-08 04:06:18,042 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-08 04:06:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:18,044 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 04:06:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 04:06:18,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:18,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:18,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:06:18,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:06:18,045 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-08 04:06:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-08 04:06:18,046 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-08 04:06:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:06:18,047 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-08 04:06:18,047 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-08 04:06:18,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-08 04:06:22,400 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-08 04:06:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-08 04:06:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:06:22,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:06:22,401 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-08 04:06:22,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:06:22,401 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:06:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:06:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 1 times [2022-04-08 04:06:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:22,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841238986] [2022-04-08 04:06:22,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:06:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 2 times [2022-04-08 04:06:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:06:22,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979251446] [2022-04-08 04:06:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:06:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:06:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:06:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#(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; {607#true} is VALID [2022-04-08 04:06:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-08 04:06:22,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {607#true} {607#true} #72#return; {607#true} is VALID [2022-04-08 04:06:22,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {607#true} call ULTIMATE.init(); {614#(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-08 04:06:22,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#(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; {607#true} is VALID [2022-04-08 04:06:22,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-08 04:06:22,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {607#true} {607#true} #72#return; {607#true} is VALID [2022-04-08 04:06:22,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {607#true} call #t~ret9 := main(); {607#true} is VALID [2022-04-08 04:06:22,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {607#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {607#true} is VALID [2022-04-08 04:06:22,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {607#true} is VALID [2022-04-08 04:06:22,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {607#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#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); {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#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; {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#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; {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {607#true} is VALID [2022-04-08 04:06:22,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {607#true} is VALID [2022-04-08 04:06:24,774 WARN L290 TraceCheckUtils]: 14: Hoare triple {607#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; {612#(<= 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-08 04:06:24,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#(<= 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; {612#(<= 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-08 04:06:24,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {612#(<= 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; {612#(<= 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-08 04:06:24,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {612#(<= 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); {612#(<= 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-08 04:06:24,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {612#(<= 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; {613#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 04:06:24,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {613#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {608#false} is VALID [2022-04-08 04:06:24,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {608#false} assume !false; {608#false} is VALID [2022-04-08 04:06:24,783 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-08 04:06:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:06:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979251446] [2022-04-08 04:06:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979251446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:06:24,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:06:24,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:06:24,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:06:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841238986] [2022-04-08 04:06:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841238986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:06:24,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:06:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:06:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312186531] [2022-04-08 04:06:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:06:24,785 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-08 04:06:24,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:06:24,786 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-08 04:06:26,965 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-08 04:06:26,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:06:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:06:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:06:26,966 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-08 04:06:31,180 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-08 04:06:33,333 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-08 04:06:37,645 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-08 04:06:39,798 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-08 04:06:44,138 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-08 04:06:46,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:06:48,449 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-08 04:06:52,832 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-08 04:06:57,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:06:59,354 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-08 04:07:01,512 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-08 04:07:05,897 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-08 04:07:08,066 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-08 04:07:14,492 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-08 04:07:18,833 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-08 04:07:20,987 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-08 04:07:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:23,353 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-08 04:07:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:07:23,353 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-08 04:07:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:23,354 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-08 04:07:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 04:07:23,356 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-08 04:07:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-08 04:07:23,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-08 04:07:27,736 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-08 04:07:27,739 INFO L225 Difference]: With dead ends: 65 [2022-04-08 04:07:27,740 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 04:07:27,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:07:27,742 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:27,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 33.5s Time] [2022-04-08 04:07:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 04:07:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-08 04:07:27,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:27,788 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-08 04:07:27,788 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-08 04:07:27,790 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-08 04:07:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:27,793 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-08 04:07:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-08 04:07:27,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:27,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:27,799 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-08 04:07:27,799 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-08 04:07:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:27,803 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-08 04:07:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-08 04:07:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:27,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:27,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:27,804 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-08 04:07:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-08 04:07:27,806 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-08 04:07:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:27,806 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-08 04:07:27,806 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-08 04:07:27,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-08 04:07:34,282 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-08 04:07:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-08 04:07:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:07:34,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:34,283 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-08 04:07:34,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:07:34,284 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 1 times [2022-04-08 04:07:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:34,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896214982] [2022-04-08 04:07:34,285 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:07:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 2 times [2022-04-08 04:07:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:34,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24282552] [2022-04-08 04:07:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:07:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:34,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {914#(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; {907#true} is VALID [2022-04-08 04:07:34,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-08 04:07:34,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {907#true} {907#true} #72#return; {907#true} is VALID [2022-04-08 04:07:34,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} call ULTIMATE.init(); {914#(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-08 04:07:34,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#(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; {907#true} is VALID [2022-04-08 04:07:34,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} assume true; {907#true} is VALID [2022-04-08 04:07:34,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} #72#return; {907#true} is VALID [2022-04-08 04:07:34,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} call #t~ret9 := main(); {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#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); {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#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; {907#true} is VALID [2022-04-08 04:07:34,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {907#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; {907#true} is VALID [2022-04-08 04:07:34,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {907#true} is VALID [2022-04-08 04:07:34,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {907#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {907#true} is VALID [2022-04-08 04:07:34,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {907#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {907#true} is VALID [2022-04-08 04:07:34,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#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); {907#true} is VALID [2022-04-08 04:07:36,671 WARN L290 TraceCheckUtils]: 15: Hoare triple {907#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; {912#(<= 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-08 04:07:36,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#(<= 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; {912#(<= 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-08 04:07:36,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#(<= 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; {912#(<= 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-08 04:07:36,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#(<= 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); {912#(<= 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-08 04:07:36,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {912#(<= 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; {913#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 04:07:36,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {908#false} is VALID [2022-04-08 04:07:36,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {908#false} assume !false; {908#false} is VALID [2022-04-08 04:07:36,679 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-08 04:07:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:07:36,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24282552] [2022-04-08 04:07:36,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24282552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:36,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:36,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:07:36,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:07:36,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896214982] [2022-04-08 04:07:36,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896214982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:07:36,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:07:36,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:07:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619142436] [2022-04-08 04:07:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:07:36,680 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-08 04:07:36,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:07:36,681 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-08 04:07:38,876 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-08 04:07:38,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:07:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:38,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:07:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:07:38,877 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-08 04:07:45,268 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-08 04:07:47,420 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-08 04:07:49,576 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-08 04:07:53,864 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-08 04:07:58,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-08 04:08:00,466 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-08 04:08:02,634 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-08 04:08:04,825 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-08 04:08:07,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:07,218 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-08 04:08:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:08:07,218 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-08 04:08:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:07,218 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-08 04:08:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 04:08:07,220 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-08 04:08:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 04:08:07,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 04:08:11,621 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-08 04:08:11,621 INFO L225 Difference]: With dead ends: 60 [2022-04-08 04:08:11,621 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:08:11,622 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-08 04:08:11,622 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.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, 51 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:11,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 18.9s Time] [2022-04-08 04:08:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:08:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:08:11,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:11,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:08:11,624 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:08:11,624 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:08:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:11,624 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:08:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:08:11,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:11,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:11,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:08:11,624 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:08:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:11,625 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:08:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:08:11,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:11,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:11,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:11,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:08:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:08:11,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-08 04:08:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:11,625 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:08:11,626 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-08 04:08:11,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:08:11,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:08:11,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:11,628 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:08:11,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:08:11,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:08:11,772 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 04:08:11,772 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 04:08:11,772 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 04:08:11,773 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-08 04:08:11,773 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-08 04:08:11,773 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 151) the Hoare annotation is: true [2022-04-08 04:08:11,773 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-08 04:08:11,773 INFO L885 garLoopResultBuilder]: At program point L23(lines 23 150) the Hoare annotation is: true [2022-04-08 04:08:11,773 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-08 04:08:11,773 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-08 04:08:11,774 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-08 04:08:11,774 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-08 04:08:11,774 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: false [2022-04-08 04:08:11,774 INFO L885 garLoopResultBuilder]: At program point L128(lines 128 143) the Hoare annotation is: true [2022-04-08 04:08:11,774 INFO L885 garLoopResultBuilder]: At program point L62(lines 62 84) the Hoare annotation is: true [2022-04-08 04:08:11,774 INFO L885 garLoopResultBuilder]: At program point L25(lines 25 145) the Hoare annotation is: true [2022-04-08 04:08:11,774 INFO L885 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-08 04:08:11,774 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 151) the Hoare annotation is: true [2022-04-08 04:08:11,774 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) the Hoare annotation is: false [2022-04-08 04:08:11,774 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-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point L117(lines 117 144) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-08 04:08:11,775 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-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,775 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-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,775 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:08:11,778 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-08 04:08:11,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:08:11,782 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:08:11,783 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 04:08:16,109 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-08 04:08:16,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:08:16 BoogieIcfgContainer [2022-04-08 04:08:16,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:08:16,118 INFO L158 Benchmark]: Toolchain (without parser) took 249455.26ms. Allocated memory was 174.1MB in the beginning and 212.9MB in the end (delta: 38.8MB). Free memory was 123.6MB in the beginning and 110.8MB in the end (delta: 12.9MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. [2022-04-08 04:08:16,118 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 139.5MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:08:16,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.31ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 148.7MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:08:16,119 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 174.1MB. Free memory was 148.7MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:08:16,119 INFO L158 Benchmark]: RCFGBuilder took 8947.70ms. Allocated memory is still 174.1MB. Free memory was 147.2MB in the beginning and 134.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:08:16,119 INFO L158 Benchmark]: TraceAbstraction took 240179.28ms. Allocated memory was 174.1MB in the beginning and 212.9MB in the end (delta: 38.8MB). Free memory was 133.5MB in the beginning and 110.8MB in the end (delta: 22.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-04-08 04:08:16,121 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.09ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 139.5MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.31ms. Allocated memory is still 174.1MB. Free memory was 123.4MB in the beginning and 148.7MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 174.1MB. Free memory was 148.7MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8947.70ms. Allocated memory is still 174.1MB. Free memory was 147.2MB in the beginning and 134.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 240179.28ms. Allocated memory was 174.1MB in the beginning and 212.9MB in the end (delta: 38.8MB). Free memory was 133.5MB in the beginning and 110.8MB in the end (delta: 22.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 235.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 203.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 106.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 100.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 104 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 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, 73 NumberOfFragments, 410 HoareAnnotationTreeSize, 28 FomulaSimplifications, 2634 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 95 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-08 04:08:16,148 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...