/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-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:57:03,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:57:03,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:57:03,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:57:03,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:57:03,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:57:03,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:57:03,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:57:03,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:57:03,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:57:03,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:57:03,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:57:03,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:57:03,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:57:03,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:57:03,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:57:03,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:57:03,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:57:03,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:57:03,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:57:03,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:57:03,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:57:03,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:57:03,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:57:03,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:57:03,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:57:03,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:57:03,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:57:03,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:57:03,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:57:03,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:57:03,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:57:03,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:57:03,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:57:03,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:57:03,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:57:03,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:57:03,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:57:03,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:57:03,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:57:03,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:57:03,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:57:03,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:57:03,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:57:03,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:57:03,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:57:03,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:57:03,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:57:03,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:57:03,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:57:03,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:57:03,142 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:57:03,142 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:57:03,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:57:03,142 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:57:03,142 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-28 02:57:03,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:57:03,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:57:03,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:57:03,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:57:03,362 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:57:03,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-28 02:57:03,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93f2a94a/1bded81b294047cabcf2f36505c93b97/FLAG0dcb96d8c [2022-04-28 02:57:03,742 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:57:03,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2022-04-28 02:57:03,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93f2a94a/1bded81b294047cabcf2f36505c93b97/FLAG0dcb96d8c [2022-04-28 02:57:03,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93f2a94a/1bded81b294047cabcf2f36505c93b97 [2022-04-28 02:57:03,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:57:03,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:57:03,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:57:03,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:57:03,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:57:03,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d220a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03, skipping insertion in model container [2022-04-28 02:57:03,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:57:03,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:57:03,905 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-acceleration/nested_1-1.c[322,335] [2022-04-28 02:57:03,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:57:03,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:57:03,946 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-acceleration/nested_1-1.c[322,335] [2022-04-28 02:57:03,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:57:03,963 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:57:03,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03 WrapperNode [2022-04-28 02:57:03,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:57:03,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:57:03,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:57:03,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:57:03,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:03,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:57:03,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:57:03,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:57:03,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:57:03,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (1/1) ... [2022-04-28 02:57:04,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:57:04,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:04,031 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-28 02:57:04,046 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-28 02:57:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:57:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:57:04,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:57:04,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:57:04,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:57:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:57:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:57:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:57:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:57:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:57:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:57:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:57:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:57:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:57:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:57:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:57:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:57:04,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:57:04,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:57:04,254 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:57:04,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:57:04,271 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 02:57:04,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:04 BoogieIcfgContainer [2022-04-28 02:57:04,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:57:04,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:57:04,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:57:04,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:57:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:57:03" (1/3) ... [2022-04-28 02:57:04,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257a1780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:04, skipping insertion in model container [2022-04-28 02:57:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:03" (2/3) ... [2022-04-28 02:57:04,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257a1780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:04, skipping insertion in model container [2022-04-28 02:57:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:04" (3/3) ... [2022-04-28 02:57:04,278 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2022-04-28 02:57:04,287 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:57:04,287 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:57:04,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:57:04,356 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@765a359d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72322d65 [2022-04-28 02:57:04,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:57:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:57:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:57:04,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:04,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:04,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 1 times [2022-04-28 02:57:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238294495] [2022-04-28 02:57:04,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:57:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2021311625, now seen corresponding path program 2 times [2022-04-28 02:57:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:04,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934655101] [2022-04-28 02:57:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:04,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 02:57:04,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:57:04,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:57:04,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:04,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 02:57:04,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:57:04,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:57:04,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-28 02:57:04,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {28#(= main_~x~0 0)} is VALID [2022-04-28 02:57:04,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {24#false} is VALID [2022-04-28 02:57:04,632 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24#false} is VALID [2022-04-28 02:57:04,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 02:57:04,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 02:57:04,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 02:57:04,633 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-28 02:57:04,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934655101] [2022-04-28 02:57:04,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934655101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:04,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:04,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:04,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238294495] [2022-04-28 02:57:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238294495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033802942] [2022-04-28 02:57:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:57:04,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:04,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:04,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:57:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:57:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:57:04,686 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:04,800 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-04-28 02:57:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:57:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:57:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 02:57:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 02:57:04,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 02:57:04,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:04,877 INFO L225 Difference]: With dead ends: 37 [2022-04-28 02:57:04,877 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:57:04,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:57:04,883 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:04,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:57:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-04-28 02:57:04,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:04,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,912 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,913 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:04,922 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:57:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:57:04,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:04,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:04,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:57:04,923 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:57:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:04,925 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:57:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:57:04,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:04,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:04,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:04,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 02:57:04,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 02:57:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:04,928 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 02:57:04,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:04,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 02:57:04,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:57:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:57:04,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:04,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:57:04,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2037585725, now seen corresponding path program 1 times [2022-04-28 02:57:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635609063] [2022-04-28 02:57:05,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:05,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -645021174, now seen corresponding path program 1 times [2022-04-28 02:57:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:05,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001217573] [2022-04-28 02:57:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-28 02:57:05,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-28 02:57:05,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-28 02:57:05,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:05,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-28 02:57:05,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-28 02:57:05,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #47#return; {172#true} is VALID [2022-04-28 02:57:05,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret6 := main(); {172#true} is VALID [2022-04-28 02:57:05,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} ~x~0 := 0;~y~0 := 0; {177#(= main_~x~0 0)} is VALID [2022-04-28 02:57:05,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(= main_~x~0 0)} [53] L16-2-->L16-3_primed: Formula: (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~y~0_7 v_main_~y~0_6) (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) InVars {main_#t~post5=|v_main_#t~post5_4|, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post5, main_~y~0] {177#(= main_~x~0 0)} is VALID [2022-04-28 02:57:05,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(= main_~x~0 0)} [52] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-28 02:57:05,187 INFO L272 TraceCheckUtils]: 8: Hoare triple {173#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {173#false} is VALID [2022-04-28 02:57:05,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-28 02:57:05,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-28 02:57:05,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-28 02:57:05,188 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-28 02:57:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:05,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001217573] [2022-04-28 02:57:05,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001217573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:05,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:05,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:05,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:05,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635609063] [2022-04-28 02:57:05,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635609063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:05,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:05,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:57:05,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605141594] [2022-04-28 02:57:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:57:05,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:05,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:57:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:57:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:57:05,223 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,277 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 02:57:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:57:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:57:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 02:57:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 02:57:05,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 02:57:05,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,303 INFO L225 Difference]: With dead ends: 26 [2022-04-28 02:57:05,303 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:57:05,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:57:05,304 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:05,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:57:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-28 02:57:05,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:05,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,308 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,308 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,309 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:57:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:57:05,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:57:05,310 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:57:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:05,311 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:57:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:57:05,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:05,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:05,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:05,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 02:57:05,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-28 02:57:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:05,313 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 02:57:05,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:05,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 02:57:05,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 02:57:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:57:05,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:05,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:05,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:57:05,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -183414982, now seen corresponding path program 1 times [2022-04-28 02:57:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:05,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95162855] [2022-04-28 02:57:05,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:05,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:05,921 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -585915830, now seen corresponding path program 1 times [2022-04-28 02:57:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:05,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437989370] [2022-04-28 02:57:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:05,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-28 02:57:05,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-28 02:57:05,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-28 02:57:05,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:05,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-04-28 02:57:05,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2022-04-28 02:57:05,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #47#return; {306#true} is VALID [2022-04-28 02:57:05,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret6 := main(); {306#true} is VALID [2022-04-28 02:57:05,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0;~y~0 := 0; {311#(= main_~x~0 0)} is VALID [2022-04-28 02:57:05,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(= main_~x~0 0)} [55] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse1 (= v_main_~x~0_15 v_main_~x~0_14))) (or (and (= v_main_~y~0_20 v_main_~y~0_18) .cse0 (= |v_main_#t~post4_10| |v_main_#t~post4_9|) .cse1) (and (= |v_main_#t~post4_9| |v_main_#t~post4_10|) .cse0 .cse1 (= v_main_~y~0_18 v_main_~y~0_20)))) InVars {main_#t~post4=|v_main_#t~post4_10|, main_#t~post5=|v_main_#t~post5_9|, main_~y~0=v_main_~y~0_20, main_~x~0=v_main_~x~0_15} OutVars{main_#t~post4=|v_main_#t~post4_9|, main_#t~post5=|v_main_#t~post5_8|, main_~y~0=v_main_~y~0_18, main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {311#(= main_~x~0 0)} is VALID [2022-04-28 02:57:05,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#(= main_~x~0 0)} [54] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {307#false} is VALID [2022-04-28 02:57:05,966 INFO L272 TraceCheckUtils]: 8: Hoare triple {307#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {307#false} is VALID [2022-04-28 02:57:05,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-28 02:57:05,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-28 02:57:05,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-28 02:57:05,967 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-28 02:57:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437989370] [2022-04-28 02:57:05,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437989370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:05,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:05,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:05,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:05,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95162855] [2022-04-28 02:57:05,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95162855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:05,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:05,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:57:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224895538] [2022-04-28 02:57:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:57:05,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:05,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:57:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:57:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:57:06,002 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,091 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 02:57:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:57:06,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 02:57:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 02:57:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-28 02:57:06,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-28 02:57:06,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,118 INFO L225 Difference]: With dead ends: 27 [2022-04-28 02:57:06,118 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 02:57:06,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:57:06,119 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:06,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 02:57:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-28 02:57:06,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:06,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,123 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,123 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,124 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 02:57:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:57:06,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 02:57:06,125 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 02:57:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:06,125 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 02:57:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:57:06,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:06,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:06,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:06,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 02:57:06,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-28 02:57:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:06,127 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 02:57:06,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:06,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 02:57:06,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 02:57:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:57:06,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:06,142 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:06,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:57:06,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1461303203, now seen corresponding path program 2 times [2022-04-28 02:57:06,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:06,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175483050] [2022-04-28 02:57:08,783 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:09,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:09,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:09,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -526810486, now seen corresponding path program 1 times [2022-04-28 02:57:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:09,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974808061] [2022-04-28 02:57:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:09,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 02:57:09,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 02:57:09,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #47#return; {449#true} is VALID [2022-04-28 02:57:09,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:09,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 02:57:09,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 02:57:09,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #47#return; {449#true} is VALID [2022-04-28 02:57:09,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret6 := main(); {449#true} is VALID [2022-04-28 02:57:09,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~x~0 := 0;~y~0 := 0; {454#(= main_~x~0 0)} is VALID [2022-04-28 02:57:09,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {454#(= main_~x~0 0)} [57] L16-2-->L16-3_primed: Formula: (and (= v_main_~y~0_35 v_main_~y~0_32) (= |v_main_#t~post4_22| |v_main_#t~post4_20|) (= v_main_~x~0_21 v_main_~x~0_20) (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) InVars {main_#t~post4=|v_main_#t~post4_22|, main_#t~post5=|v_main_#t~post5_14|, main_~y~0=v_main_~y~0_35, main_~x~0=v_main_~x~0_21} OutVars{main_#t~post4=|v_main_#t~post4_20|, main_#t~post5=|v_main_#t~post5_13|, main_~y~0=v_main_~y~0_32, main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {454#(= main_~x~0 0)} is VALID [2022-04-28 02:57:09,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= main_~x~0 0)} [56] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {450#false} is VALID [2022-04-28 02:57:09,123 INFO L272 TraceCheckUtils]: 8: Hoare triple {450#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {450#false} is VALID [2022-04-28 02:57:09,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID [2022-04-28 02:57:09,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID [2022-04-28 02:57:09,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-28 02:57:09,124 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-28 02:57:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974808061] [2022-04-28 02:57:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974808061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:09,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:09,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:09,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175483050] [2022-04-28 02:57:09,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175483050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:09,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:09,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:57:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470628285] [2022-04-28 02:57:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:09,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:57:09,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:09,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:09,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:57:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:57:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:57:09,176 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:09,302 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 02:57:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:57:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:57:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 02:57:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 02:57:09,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-28 02:57:09,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:09,331 INFO L225 Difference]: With dead ends: 28 [2022-04-28 02:57:09,331 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:57:09,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:57:09,332 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:09,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:57:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-28 02:57:09,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:09,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,335 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,336 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:09,337 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:57:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 02:57:09,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:09,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:09,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:57:09,337 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:57:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:09,338 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:57:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 02:57:09,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:09,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:09,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:09,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 02:57:09,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-04-28 02:57:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:09,340 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 02:57:09,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:09,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 02:57:09,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 02:57:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:57:09,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:09,354 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:57:09,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash 907959386, now seen corresponding path program 3 times [2022-04-28 02:57:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:09,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854160911] [2022-04-28 02:57:10,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:10,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:10,696 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -467705142, now seen corresponding path program 1 times [2022-04-28 02:57:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462596695] [2022-04-28 02:57:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:10,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {601#true} is VALID [2022-04-28 02:57:10,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 02:57:10,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #47#return; {601#true} is VALID [2022-04-28 02:57:10,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:10,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {601#true} is VALID [2022-04-28 02:57:10,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2022-04-28 02:57:10,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #47#return; {601#true} is VALID [2022-04-28 02:57:10,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret6 := main(); {601#true} is VALID [2022-04-28 02:57:10,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#true} ~x~0 := 0;~y~0 := 0; {606#(= main_~x~0 0)} is VALID [2022-04-28 02:57:10,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {606#(= main_~x~0 0)} [59] L16-2-->L16-3_primed: Formula: (and (= |v_main_#t~post4_35| |v_main_#t~post4_32|) (= v_main_~y~0_52 v_main_~y~0_48) (= |v_main_#t~post5_19| |v_main_#t~post5_18|) (= v_main_~x~0_27 v_main_~x~0_26)) InVars {main_#t~post4=|v_main_#t~post4_35|, main_#t~post5=|v_main_#t~post5_19|, main_~y~0=v_main_~y~0_52, main_~x~0=v_main_~x~0_27} OutVars{main_#t~post4=|v_main_#t~post4_32|, main_#t~post5=|v_main_#t~post5_18|, main_~y~0=v_main_~y~0_48, main_~x~0=v_main_~x~0_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {606#(= main_~x~0 0)} is VALID [2022-04-28 02:57:10,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(= main_~x~0 0)} [58] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {602#false} is VALID [2022-04-28 02:57:10,757 INFO L272 TraceCheckUtils]: 8: Hoare triple {602#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {602#false} is VALID [2022-04-28 02:57:10,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2022-04-28 02:57:10,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2022-04-28 02:57:10,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {602#false} assume !false; {602#false} is VALID [2022-04-28 02:57:10,758 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-28 02:57:10,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:10,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462596695] [2022-04-28 02:57:10,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462596695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:10,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:10,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:10,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:10,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854160911] [2022-04-28 02:57:10,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854160911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:10,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:10,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:57:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200924305] [2022-04-28 02:57:10,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:57:10,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:10,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:10,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:57:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:57:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:57:10,810 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:10,958 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 02:57:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:57:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:57:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 02:57:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 02:57:10,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-28 02:57:10,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:10,982 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:57:10,982 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 02:57:10,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:57:10,984 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:10,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 02:57:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-28 02:57:10,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:10,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,992 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,992 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:10,993 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 02:57:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 02:57:10,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:10,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:10,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 02:57:10,997 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 02:57:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:10,997 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 02:57:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 02:57:11,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:11,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:11,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:11,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 02:57:11,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-04-28 02:57:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:11,003 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 02:57:11,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:11,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 02:57:11,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 02:57:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:57:11,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:11,019 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:11,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:57:11,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 934170243, now seen corresponding path program 4 times [2022-04-28 02:57:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:11,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1551210260] [2022-04-28 02:57:12,160 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:12,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:12,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:12,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash -408599798, now seen corresponding path program 1 times [2022-04-28 02:57:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895175626] [2022-04-28 02:57:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:12,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {762#true} is VALID [2022-04-28 02:57:12,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#true} assume true; {762#true} is VALID [2022-04-28 02:57:12,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {762#true} {762#true} #47#return; {762#true} is VALID [2022-04-28 02:57:12,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:12,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {762#true} is VALID [2022-04-28 02:57:12,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2022-04-28 02:57:12,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #47#return; {762#true} is VALID [2022-04-28 02:57:12,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret6 := main(); {762#true} is VALID [2022-04-28 02:57:12,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {762#true} ~x~0 := 0;~y~0 := 0; {767#(= main_~x~0 0)} is VALID [2022-04-28 02:57:12,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {767#(= main_~x~0 0)} [61] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse1 (= v_main_~y~0_71 v_main_~y~0_66)) (.cse2 (= v_main_~x~0_33 v_main_~x~0_32))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post4_49| |v_main_#t~post4_45|)) (and (= |v_main_#t~post4_45| |v_main_#t~post4_49|) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_49|, main_#t~post5=|v_main_#t~post5_24|, main_~y~0=v_main_~y~0_71, main_~x~0=v_main_~x~0_33} OutVars{main_#t~post4=|v_main_#t~post4_45|, main_#t~post5=|v_main_#t~post5_23|, main_~y~0=v_main_~y~0_66, main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {767#(= main_~x~0 0)} is VALID [2022-04-28 02:57:12,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#(= main_~x~0 0)} [60] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {763#false} is VALID [2022-04-28 02:57:12,506 INFO L272 TraceCheckUtils]: 8: Hoare triple {763#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {763#false} is VALID [2022-04-28 02:57:12,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2022-04-28 02:57:12,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {763#false} assume 0 == ~cond; {763#false} is VALID [2022-04-28 02:57:12,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#false} assume !false; {763#false} is VALID [2022-04-28 02:57:12,508 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-28 02:57:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895175626] [2022-04-28 02:57:12,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895175626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:12,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:12,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:12,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1551210260] [2022-04-28 02:57:12,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1551210260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:12,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:12,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:57:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206965109] [2022-04-28 02:57:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:57:12,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:12,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:12,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:57:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:57:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:57:12,589 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:12,792 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:57:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:57:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 02:57:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 02:57:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 02:57:12,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-28 02:57:12,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:12,820 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:57:12,820 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:57:12,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:57:12,823 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:12,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:57:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-28 02:57:12,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:12,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,826 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,827 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:12,828 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:57:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:57:12,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:12,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:12,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:57:12,830 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:57:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:12,831 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:57:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:57:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:12,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:12,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:12,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 02:57:12,834 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2022-04-28 02:57:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:12,834 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 02:57:12,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:12,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 02:57:12,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 02:57:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:57:12,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:12,851 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:12,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:57:12,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1746706810, now seen corresponding path program 5 times [2022-04-28 02:57:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263340762] [2022-04-28 02:57:13,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:13,383 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:13,383 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -349494454, now seen corresponding path program 1 times [2022-04-28 02:57:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814024544] [2022-04-28 02:57:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:13,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {932#true} is VALID [2022-04-28 02:57:13,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 02:57:13,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {932#true} {932#true} #47#return; {932#true} is VALID [2022-04-28 02:57:13,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:13,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {932#true} is VALID [2022-04-28 02:57:13,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2022-04-28 02:57:13,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #47#return; {932#true} is VALID [2022-04-28 02:57:13,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret6 := main(); {932#true} is VALID [2022-04-28 02:57:13,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {932#true} ~x~0 := 0;~y~0 := 0; {937#(= main_~x~0 0)} is VALID [2022-04-28 02:57:13,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {937#(= main_~x~0 0)} [63] L16-2-->L16-3_primed: Formula: (and (= |v_main_#t~post4_64| |v_main_#t~post4_59|) (= v_main_~y~0_92 v_main_~y~0_86) (= v_main_~x~0_39 v_main_~x~0_38) (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) InVars {main_#t~post4=|v_main_#t~post4_64|, main_#t~post5=|v_main_#t~post5_29|, main_~y~0=v_main_~y~0_92, main_~x~0=v_main_~x~0_39} OutVars{main_#t~post4=|v_main_#t~post4_59|, main_#t~post5=|v_main_#t~post5_28|, main_~y~0=v_main_~y~0_86, main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {937#(= main_~x~0 0)} is VALID [2022-04-28 02:57:13,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {937#(= main_~x~0 0)} [62] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {933#false} is VALID [2022-04-28 02:57:13,439 INFO L272 TraceCheckUtils]: 8: Hoare triple {933#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {933#false} is VALID [2022-04-28 02:57:13,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#false} ~cond := #in~cond; {933#false} is VALID [2022-04-28 02:57:13,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {933#false} assume 0 == ~cond; {933#false} is VALID [2022-04-28 02:57:13,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {933#false} assume !false; {933#false} is VALID [2022-04-28 02:57:13,439 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-28 02:57:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:13,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814024544] [2022-04-28 02:57:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814024544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:13,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:13,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:13,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:13,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263340762] [2022-04-28 02:57:13,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263340762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:13,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:13,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:57:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48121697] [2022-04-28 02:57:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:57:13,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:13,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:57:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:13,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:57:13,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:57:13,534 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,725 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 02:57:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:57:13,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 02:57:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 02:57:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 02:57:13,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-28 02:57:13,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:13,751 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:57:13,751 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 02:57:13,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:57:13,752 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:13,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 02:57:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 02:57:13,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:13,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,755 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,755 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,756 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 02:57:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 02:57:13,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:13,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:13,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 02:57:13,756 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 02:57:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:13,757 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 02:57:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 02:57:13,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:13,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:13,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:13,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 02:57:13,758 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2022-04-28 02:57:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:13,758 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 02:57:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:13,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 02:57:13,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 02:57:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:57:13,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:13,775 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:13,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:57:13,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1165536611, now seen corresponding path program 6 times [2022-04-28 02:57:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:13,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705171429] [2022-04-28 02:57:15,401 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:15,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:15,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:15,589 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -290389110, now seen corresponding path program 1 times [2022-04-28 02:57:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:15,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114467889] [2022-04-28 02:57:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:15,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1111#true} is VALID [2022-04-28 02:57:15,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1111#true} assume true; {1111#true} is VALID [2022-04-28 02:57:15,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1111#true} {1111#true} #47#return; {1111#true} is VALID [2022-04-28 02:57:15,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {1111#true} call ULTIMATE.init(); {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:15,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1111#true} is VALID [2022-04-28 02:57:15,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1111#true} assume true; {1111#true} is VALID [2022-04-28 02:57:15,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1111#true} {1111#true} #47#return; {1111#true} is VALID [2022-04-28 02:57:15,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {1111#true} call #t~ret6 := main(); {1111#true} is VALID [2022-04-28 02:57:15,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1111#true} ~x~0 := 0;~y~0 := 0; {1116#(= main_~x~0 0)} is VALID [2022-04-28 02:57:15,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~x~0 0)} [65] L16-2-->L16-3_primed: Formula: (and (= v_main_~x~0_45 v_main_~x~0_44) (= |v_main_#t~post5_34| |v_main_#t~post5_33|) (= v_main_~y~0_115 v_main_~y~0_108) (= |v_main_#t~post4_80| |v_main_#t~post4_74|)) InVars {main_#t~post4=|v_main_#t~post4_80|, main_#t~post5=|v_main_#t~post5_34|, main_~y~0=v_main_~y~0_115, main_~x~0=v_main_~x~0_45} OutVars{main_#t~post4=|v_main_#t~post4_74|, main_#t~post5=|v_main_#t~post5_33|, main_~y~0=v_main_~y~0_108, main_~x~0=v_main_~x~0_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1116#(= main_~x~0 0)} is VALID [2022-04-28 02:57:15,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~x~0 0)} [64] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1112#false} is VALID [2022-04-28 02:57:15,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {1112#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1112#false} is VALID [2022-04-28 02:57:15,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {1112#false} ~cond := #in~cond; {1112#false} is VALID [2022-04-28 02:57:15,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {1112#false} assume 0 == ~cond; {1112#false} is VALID [2022-04-28 02:57:15,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {1112#false} assume !false; {1112#false} is VALID [2022-04-28 02:57:15,629 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-28 02:57:15,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:15,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114467889] [2022-04-28 02:57:15,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114467889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:15,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:15,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:15,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:15,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705171429] [2022-04-28 02:57:15,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705171429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:15,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:15,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:57:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886034195] [2022-04-28 02:57:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:57:15,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:15,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:57:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:57:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:57:15,720 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,918 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 02:57:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:57:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:57:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:57:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:57:15,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-28 02:57:15,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:15,951 INFO L225 Difference]: With dead ends: 32 [2022-04-28 02:57:15,951 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:57:15,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:57:15,952 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:15,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:57:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-28 02:57:15,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:15,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,954 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,955 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,955 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 02:57:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 02:57:15,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:15,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:15,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:57:15,956 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 02:57:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:15,956 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 02:57:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 02:57:15,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:15,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:15,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:15,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 02:57:15,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-04-28 02:57:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:15,958 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 02:57:15,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:15,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 02:57:15,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 02:57:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:57:15,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:15,979 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:15,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:57:15,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 329129626, now seen corresponding path program 7 times [2022-04-28 02:57:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:15,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528212488] [2022-04-28 02:57:17,303 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:17,443 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:17,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:17,514 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -231283766, now seen corresponding path program 1 times [2022-04-28 02:57:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:17,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852772964] [2022-04-28 02:57:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:17,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {1305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1299#true} is VALID [2022-04-28 02:57:17,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {1299#true} assume true; {1299#true} is VALID [2022-04-28 02:57:17,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1299#true} {1299#true} #47#return; {1299#true} is VALID [2022-04-28 02:57:17,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {1299#true} call ULTIMATE.init(); {1305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:17,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1299#true} is VALID [2022-04-28 02:57:17,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {1299#true} assume true; {1299#true} is VALID [2022-04-28 02:57:17,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1299#true} {1299#true} #47#return; {1299#true} is VALID [2022-04-28 02:57:17,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {1299#true} call #t~ret6 := main(); {1299#true} is VALID [2022-04-28 02:57:17,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {1299#true} ~x~0 := 0;~y~0 := 0; {1304#(= main_~x~0 0)} is VALID [2022-04-28 02:57:17,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {1304#(= main_~x~0 0)} [67] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_140 v_main_~y~0_132)) (.cse1 (= v_main_~x~0_51 v_main_~x~0_50)) (.cse2 (= |v_main_#t~post4_97| |v_main_#t~post4_90|))) (or (and .cse0 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse1 .cse2) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_97|, main_#t~post5=|v_main_#t~post5_39|, main_~y~0=v_main_~y~0_140, main_~x~0=v_main_~x~0_51} OutVars{main_#t~post4=|v_main_#t~post4_90|, main_#t~post5=|v_main_#t~post5_38|, main_~y~0=v_main_~y~0_132, main_~x~0=v_main_~x~0_50} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1304#(= main_~x~0 0)} is VALID [2022-04-28 02:57:17,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1304#(= main_~x~0 0)} [66] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1300#false} is VALID [2022-04-28 02:57:17,550 INFO L272 TraceCheckUtils]: 8: Hoare triple {1300#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1300#false} is VALID [2022-04-28 02:57:17,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#false} ~cond := #in~cond; {1300#false} is VALID [2022-04-28 02:57:17,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {1300#false} assume 0 == ~cond; {1300#false} is VALID [2022-04-28 02:57:17,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#false} assume !false; {1300#false} is VALID [2022-04-28 02:57:17,550 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-28 02:57:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852772964] [2022-04-28 02:57:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852772964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:17,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:17,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:17,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528212488] [2022-04-28 02:57:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528212488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:17,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:57:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293022571] [2022-04-28 02:57:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:57:17,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:17,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:17,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:17,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 02:57:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:17,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 02:57:17,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:57:17,701 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:17,972 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 02:57:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:57:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:57:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-04-28 02:57:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2022-04-28 02:57:17,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2022-04-28 02:57:17,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:17,999 INFO L225 Difference]: With dead ends: 33 [2022-04-28 02:57:17,999 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:57:18,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:57:18,000 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:18,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:57:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-28 02:57:18,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:18,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,003 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,003 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:18,004 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 02:57:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:57:18,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:18,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:18,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:57:18,004 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:57:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:18,005 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 02:57:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:57:18,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:18,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:18,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:18,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 02:57:18,006 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-04-28 02:57:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:18,006 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 02:57:18,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:18,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 02:57:18,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 02:57:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:57:18,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:18,026 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:18,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:57:18,027 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 170316867, now seen corresponding path program 8 times [2022-04-28 02:57:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:18,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [339880138] [2022-04-28 02:57:21,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:21,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:21,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash -172178422, now seen corresponding path program 1 times [2022-04-28 02:57:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:21,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091885907] [2022-04-28 02:57:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:21,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1496#true} is VALID [2022-04-28 02:57:21,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-28 02:57:21,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1496#true} {1496#true} #47#return; {1496#true} is VALID [2022-04-28 02:57:21,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {1496#true} call ULTIMATE.init(); {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:21,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1496#true} is VALID [2022-04-28 02:57:21,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-28 02:57:21,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1496#true} {1496#true} #47#return; {1496#true} is VALID [2022-04-28 02:57:21,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {1496#true} call #t~ret6 := main(); {1496#true} is VALID [2022-04-28 02:57:21,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#true} ~x~0 := 0;~y~0 := 0; {1501#(= main_~x~0 0)} is VALID [2022-04-28 02:57:21,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {1501#(= main_~x~0 0)} [69] L16-2-->L16-3_primed: Formula: (and (= v_main_~x~0_57 v_main_~x~0_56) (= |v_main_#t~post4_115| |v_main_#t~post4_107|) (= |v_main_#t~post5_44| |v_main_#t~post5_43|) (= v_main_~y~0_167 v_main_~y~0_158)) InVars {main_#t~post4=|v_main_#t~post4_115|, main_#t~post5=|v_main_#t~post5_44|, main_~y~0=v_main_~y~0_167, main_~x~0=v_main_~x~0_57} OutVars{main_#t~post4=|v_main_#t~post4_107|, main_#t~post5=|v_main_#t~post5_43|, main_~y~0=v_main_~y~0_158, main_~x~0=v_main_~x~0_56} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1501#(= main_~x~0 0)} is VALID [2022-04-28 02:57:21,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#(= main_~x~0 0)} [68] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1497#false} is VALID [2022-04-28 02:57:21,153 INFO L272 TraceCheckUtils]: 8: Hoare triple {1497#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1497#false} is VALID [2022-04-28 02:57:21,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1497#false} ~cond := #in~cond; {1497#false} is VALID [2022-04-28 02:57:21,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {1497#false} assume 0 == ~cond; {1497#false} is VALID [2022-04-28 02:57:21,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-28 02:57:21,154 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-28 02:57:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091885907] [2022-04-28 02:57:21,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091885907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:21,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:21,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:21,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [339880138] [2022-04-28 02:57:21,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [339880138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:21,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:21,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 02:57:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479334594] [2022-04-28 02:57:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:57:21,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:21,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 02:57:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 02:57:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:57:21,270 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:21,585 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 02:57:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:57:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:57:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-28 02:57:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2022-04-28 02:57:21,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2022-04-28 02:57:21,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:21,618 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:57:21,618 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:57:21,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:57:21,620 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:21,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 54 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:57:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-28 02:57:21,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:21,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,623 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,623 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:21,624 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:57:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:57:21,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:21,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:21,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 02:57:21,625 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 02:57:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:21,625 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:57:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:57:21,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:21,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:21,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:21,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 02:57:21,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2022-04-28 02:57:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:21,626 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 02:57:21,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:21,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 02:57:21,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 02:57:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:57:21,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:21,649 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:21,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:57:21,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:21,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:21,650 INFO L85 PathProgramCache]: Analyzing trace with hash -457911366, now seen corresponding path program 9 times [2022-04-28 02:57:21,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:21,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457048112] [2022-04-28 02:57:21,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:22,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:22,031 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -113073078, now seen corresponding path program 1 times [2022-04-28 02:57:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123035768] [2022-04-28 02:57:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:22,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1702#true} is VALID [2022-04-28 02:57:22,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-04-28 02:57:22,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1702#true} {1702#true} #47#return; {1702#true} is VALID [2022-04-28 02:57:22,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1702#true} call ULTIMATE.init(); {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:22,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1702#true} is VALID [2022-04-28 02:57:22,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-04-28 02:57:22,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1702#true} #47#return; {1702#true} is VALID [2022-04-28 02:57:22,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1702#true} call #t~ret6 := main(); {1702#true} is VALID [2022-04-28 02:57:22,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#true} ~x~0 := 0;~y~0 := 0; {1707#(= main_~x~0 0)} is VALID [2022-04-28 02:57:22,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {1707#(= main_~x~0 0)} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse2 (= |v_main_#t~post4_134| |v_main_#t~post4_125|))) (or (and .cse0 (= v_main_~y~0_186 v_main_~y~0_196) .cse1 .cse2) (and .cse0 (= v_main_~y~0_196 v_main_~y~0_186) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_134|, main_#t~post5=|v_main_#t~post5_49|, main_~y~0=v_main_~y~0_196, main_~x~0=v_main_~x~0_63} OutVars{main_#t~post4=|v_main_#t~post4_125|, main_#t~post5=|v_main_#t~post5_48|, main_~y~0=v_main_~y~0_186, main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1707#(= main_~x~0 0)} is VALID [2022-04-28 02:57:22,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1707#(= main_~x~0 0)} [70] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1703#false} is VALID [2022-04-28 02:57:22,065 INFO L272 TraceCheckUtils]: 8: Hoare triple {1703#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1703#false} is VALID [2022-04-28 02:57:22,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-04-28 02:57:22,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1703#false} assume 0 == ~cond; {1703#false} is VALID [2022-04-28 02:57:22,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2022-04-28 02:57:22,065 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-28 02:57:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:22,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123035768] [2022-04-28 02:57:22,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123035768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:22,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:22,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:22,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:22,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457048112] [2022-04-28 02:57:22,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457048112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:22,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:22,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:57:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338980055] [2022-04-28 02:57:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:22,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:57:22,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:22,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:22,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:57:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:57:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:57:22,211 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:22,529 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 02:57:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:57:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 02:57:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-04-28 02:57:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2022-04-28 02:57:22,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 39 transitions. [2022-04-28 02:57:22,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:22,559 INFO L225 Difference]: With dead ends: 35 [2022-04-28 02:57:22,559 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 02:57:22,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:57:22,560 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:22,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:57:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 02:57:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-28 02:57:22,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:22,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,563 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,563 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:22,563 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 02:57:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 02:57:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:22,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 02:57:22,564 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 02:57:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:22,564 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 02:57:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 02:57:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:22,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:22,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:22,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 02:57:22,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2022-04-28 02:57:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:22,565 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 02:57:22,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:22,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 02:57:22,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 02:57:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:57:22,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:22,592 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:22,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:57:22,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1541849891, now seen corresponding path program 10 times [2022-04-28 02:57:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:22,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612566875] [2022-04-28 02:57:22,944 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:25,791 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:25,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:25,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -53967734, now seen corresponding path program 1 times [2022-04-28 02:57:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342696684] [2022-04-28 02:57:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:26,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {1927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1917#true} is VALID [2022-04-28 02:57:26,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1917#true} assume true; {1917#true} is VALID [2022-04-28 02:57:26,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1917#true} {1917#true} #47#return; {1917#true} is VALID [2022-04-28 02:57:26,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1917#true} call ULTIMATE.init(); {1927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:26,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1917#true} is VALID [2022-04-28 02:57:26,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1917#true} assume true; {1917#true} is VALID [2022-04-28 02:57:26,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1917#true} {1917#true} #47#return; {1917#true} is VALID [2022-04-28 02:57:26,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1917#true} call #t~ret6 := main(); {1917#true} is VALID [2022-04-28 02:57:26,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1917#true} ~x~0 := 0;~y~0 := 0; {1922#(= main_~x~0 0)} is VALID [2022-04-28 02:57:26,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#(= main_~x~0 0)} [73] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_154| |v_main_#t~post4_144|)) (.cse3 (mod v_main_~x~0_69 4294967296)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (= v_main_~x~0_69 v_main_~x~0_68))) (or (and .cse0 (= v_main_~y~0_227 v_main_~y~0_216) .cse1 .cse2) (and (< .cse3 268435455) (<= (div (+ 268435455 (* (- 1) v_main_~x~0_68)) (- 4294967296)) (+ 1 (div (+ v_main_~x~0_69 (- 4294967295)) 4294967296))) (= v_main_~y~0_216 10) (< v_main_~x~0_69 v_main_~x~0_68)) (and .cse0 (= v_main_~y~0_216 v_main_~y~0_227) (<= 268435455 .cse3) .cse1 .cse2))) InVars {main_#t~post4=|v_main_#t~post4_154|, main_#t~post5=|v_main_#t~post5_54|, main_~y~0=v_main_~y~0_227, main_~x~0=v_main_~x~0_69} OutVars{main_#t~post4=|v_main_#t~post4_144|, main_#t~post5=|v_main_#t~post5_53|, main_~y~0=v_main_~y~0_216, main_~x~0=v_main_~x~0_68} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_#t~post5, main_~y~0] {1923#(and (<= (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:57:26,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {1923#(and (<= (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [72] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_6 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1924#(and (<= (+ (* (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296) 268435455 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:57:26,099 INFO L272 TraceCheckUtils]: 8: Hoare triple {1924#(and (<= (+ (* (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296) 268435455 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:57:26,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:57:26,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1918#false} is VALID [2022-04-28 02:57:26,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#false} assume !false; {1918#false} is VALID [2022-04-28 02:57:26,101 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-28 02:57:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342696684] [2022-04-28 02:57:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342696684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:57:26,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:26,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612566875] [2022-04-28 02:57:26,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612566875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:26,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:26,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:57:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423879756] [2022-04-28 02:57:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:57:26,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:26,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:26,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:26,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:57:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:26,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:57:26,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:57:26,632 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:27,718 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-04-28 02:57:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:57:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:57:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2022-04-28 02:57:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2022-04-28 02:57:27,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 54 transitions. [2022-04-28 02:57:27,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:27,813 INFO L225 Difference]: With dead ends: 41 [2022-04-28 02:57:27,813 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:57:27,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:57:27,814 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:27,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:57:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:57:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:57:27,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:27,815 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-28 02:57:27,815 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-28 02:57:27,815 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-28 02:57:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:27,816 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:57:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:57:27,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:27,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:27,816 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-28 02:57:27,816 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-28 02:57:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:27,816 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:57:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:57:27,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:27,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:27,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:27,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:27,817 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-28 02:57:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:57:27,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 02:57:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:27,817 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:57:27,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:27,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:57:27,817 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-28 02:57:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:57:27,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:27,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:57:27,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:57:27,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:57:29,700 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 02:57:29,700 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 02:57:29,700 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (let ((.cse0 (< (mod main_~x~0 4294967296) 268435455)) (.cse1 (or (= main_~x~0 0) (and (<= (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0))))) (or (and (= main_~y~0 6) .cse0 .cse1) (and .cse0 (= main_~y~0 10) .cse1) (and .cse0 .cse1 (= main_~y~0 0)) (and .cse0 .cse1 (= main_~y~0 4)) (and .cse0 .cse1 (= 5 main_~y~0)) (and (= main_~y~0 2) .cse0 .cse1) (and .cse0 (= main_~y~0 8) .cse1) (and .cse0 .cse1 (= main_~y~0 3)) (and .cse0 (= main_~y~0 9) .cse1) (and .cse0 (= 7 main_~y~0) .cse1) (and .cse0 (= main_~y~0 1) .cse1))) [2022-04-28 02:57:29,701 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (and (< (mod main_~x~0 4294967296) 268435455) (= main_~y~0 10) (or (= main_~x~0 0) (and (<= (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 main_~x~0)))) [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-28 02:57:29,701 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 24) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 10) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (or (= (+ (- 1) main_~x~0) 0) (and (<= (div (+ 268435456 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 1 main_~x~0))))) [2022-04-28 02:57:29,702 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 24) the Hoare annotation is: (let ((.cse0 (div main_~x~0 4294967296))) (and (= main_~y~0 10) (<= (+ (* (div (+ 268435455 (* (- 1) main_~x~0)) (- 4294967296)) 4294967296) 268435455 (* 4294967296 .cse0)) main_~x~0) (< 0 (+ .cse0 1)))) [2022-04-28 02:57:29,702 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 02:57:29,702 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 02:57:29,702 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 02:57:29,702 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 02:57:29,702 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 02:57:29,702 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 02:57:29,704 INFO L356 BasicCegarLoop]: Path program histogram: [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:29,705 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:57:29,709 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:57:29,710 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:57:29,726 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:57:29,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:57:29 BoogieIcfgContainer [2022-04-28 02:57:29,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:57:29,748 INFO L158 Benchmark]: Toolchain (without parser) took 25988.45ms. Allocated memory was 227.5MB in the beginning and 329.3MB in the end (delta: 101.7MB). Free memory was 179.0MB in the beginning and 156.3MB in the end (delta: 22.7MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. [2022-04-28 02:57:29,748 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 227.5MB. Free memory is still 195.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:57:29,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.36ms. Allocated memory is still 227.5MB. Free memory was 178.6MB in the beginning and 203.8MB in the end (delta: -25.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:57:29,748 INFO L158 Benchmark]: Boogie Preprocessor took 29.89ms. Allocated memory is still 227.5MB. Free memory was 203.8MB in the beginning and 202.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:57:29,749 INFO L158 Benchmark]: RCFGBuilder took 277.63ms. Allocated memory is still 227.5MB. Free memory was 202.3MB in the beginning and 191.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:57:29,749 INFO L158 Benchmark]: TraceAbstraction took 25473.35ms. Allocated memory was 227.5MB in the beginning and 329.3MB in the end (delta: 101.7MB). Free memory was 191.4MB in the beginning and 156.3MB in the end (delta: 35.1MB). Peak memory consumption was 189.6MB. Max. memory is 8.0GB. [2022-04-28 02:57:29,749 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.08ms. Allocated memory is still 227.5MB. Free memory is still 195.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.36ms. Allocated memory is still 227.5MB. Free memory was 178.6MB in the beginning and 203.8MB in the end (delta: -25.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.89ms. Allocated memory is still 227.5MB. Free memory was 203.8MB in the beginning and 202.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 277.63ms. Allocated memory is still 227.5MB. Free memory was 202.3MB in the beginning and 191.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25473.35ms. Allocated memory was 227.5MB in the beginning and 329.3MB in the end (delta: 101.7MB). Free memory was 191.4MB in the beginning and 156.3MB in the end (delta: 35.1MB). Peak memory consumption was 189.6MB. 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: 7]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1150 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 145 mSDtfsCounter, 1150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 118 SyntacticMatches, 11 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=11, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 22 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 92 PreInvPairs, 145 NumberOfFragments, 415 HoareAnnotationTreeSize, 92 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 74 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (x == 0 && y == 0) || ((y == 10 && (x + 4294967295) % 4294967296 < 268435455) && (-1 + x == 0 || ((268435456 + -1 * x) / -4294967296 <= 0 && 1 < x))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((((y == 6 && x % 4294967296 < 268435455) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) || ((x % 4294967296 < 268435455 && y == 10) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x)))) || ((x % 4294967296 < 268435455 && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) && y == 0)) || ((x % 4294967296 < 268435455 && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) && y == 4)) || ((x % 4294967296 < 268435455 && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) && 5 == y)) || ((y == 2 && x % 4294967296 < 268435455) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x)))) || ((x % 4294967296 < 268435455 && y == 8) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x)))) || ((x % 4294967296 < 268435455 && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) && y == 3)) || ((x % 4294967296 < 268435455 && y == 9) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x)))) || ((x % 4294967296 < 268435455 && 7 == y) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x)))) || ((x % 4294967296 < 268435455 && y == 1) && (x == 0 || ((268435455 + -1 * x) / -4294967296 <= 0 && 0 < x))) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:57:29,770 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...