/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:01:43,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:01:43,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:01:43,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:01:43,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:01:43,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:01:43,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:01:43,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:01:43,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:01:43,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:01:43,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:01:43,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:01:43,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:01:43,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:01:43,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:01:43,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:01:43,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:01:43,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:01:43,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:01:43,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:01:43,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:01:43,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:01:43,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:01:43,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:01:43,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:01:43,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:01:43,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:01:43,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:01:43,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:01:43,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:01:43,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:01:43,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:01:43,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:01:43,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:01:43,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:01:43,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:01:43,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:01:43,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:01:43,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:01:43,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:01:43,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:01:43,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:01:43,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:01:43,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:01:43,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:01:43,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:01:43,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:01:43,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:01:43,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:43,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:01:43,139 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:01:43,140 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 09:01:43,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:01:43,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:01:43,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:01:43,315 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:01:43,315 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:01:43,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-28 09:01:43,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7d71e08/bb088aea53494138bca843b00853e8b1/FLAG0395ab262 [2022-04-28 09:01:43,723 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:01:43,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-28 09:01:43,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7d71e08/bb088aea53494138bca843b00853e8b1/FLAG0395ab262 [2022-04-28 09:01:43,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7d71e08/bb088aea53494138bca843b00853e8b1 [2022-04-28 09:01:43,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:01:43,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:01:43,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:43,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:01:43,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:01:43,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d11affb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43, skipping insertion in model container [2022-04-28 09:01:43,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:01:43,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:01:43,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-28 09:01:43,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:43,952 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:01:43,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-28 09:01:43,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:01:43,971 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:01:43,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43 WrapperNode [2022-04-28 09:01:43,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:01:43,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:01:43,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:01:43,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:01:43,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:43,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:44,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:44,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:01:44,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:01:44,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:01:44,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:01:44,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (1/1) ... [2022-04-28 09:01:44,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:01:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:44,034 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 09:01:44,045 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 09:01:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:01:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:01:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:01:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:01:44,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:01:44,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:01:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:01:44,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:01:44,123 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:01:44,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:01:44,227 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:01:44,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:01:44,232 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:01:44,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:44 BoogieIcfgContainer [2022-04-28 09:01:44,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:01:44,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:01:44,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:01:44,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:01:44,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:01:43" (1/3) ... [2022-04-28 09:01:44,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669d90b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:44, skipping insertion in model container [2022-04-28 09:01:44,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:01:43" (2/3) ... [2022-04-28 09:01:44,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669d90b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:01:44, skipping insertion in model container [2022-04-28 09:01:44,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:01:44" (3/3) ... [2022-04-28 09:01:44,249 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2022-04-28 09:01:44,258 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:01:44,258 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:01:44,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:01:44,325 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@67e66240, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@445ef485 [2022-04-28 09:01:44,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:01:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 09:01:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:01:44,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:44,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:44,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-28 09:01:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:44,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712931046] [2022-04-28 09:01:44,366 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:01:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-28 09:01:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:44,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432993892] [2022-04-28 09:01:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:44,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(36, 2); {23#true} is VALID [2022-04-28 09:01:44,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:01:44,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 09:01:44,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:44,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(36, 2); {23#true} is VALID [2022-04-28 09:01:44,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 09:01:44,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 09:01:44,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 09:01:44,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-28 09:01:44,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 09:01:44,495 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-28 09:01:44,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 09:01:44,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 09:01:44,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 09:01:44,496 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 09:01:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:44,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432993892] [2022-04-28 09:01:44,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432993892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:44,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:44,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:01:44,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:44,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712931046] [2022-04-28 09:01:44,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712931046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:44,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:44,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:01:44,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487742963] [2022-04-28 09:01:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:44,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,519 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 09:01:44,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:01:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:01:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:01:44,534 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,597 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 09:01:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:01:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 09:01:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 09:01:44,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-28 09:01:44,659 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 09:01:44,665 INFO L225 Difference]: With dead ends: 31 [2022-04-28 09:01:44,666 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:01:44,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:01:44,673 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:44,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:01:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:01:44,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:44,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,696 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,696 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,698 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 09:01:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 09:01:44,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:44,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:44,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:01:44,699 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:01:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,704 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 09:01:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 09:01:44,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:44,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:44,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:44,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:01:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 09:01:44,711 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 09:01:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:44,711 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 09:01:44,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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 09:01:44,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 09:01:44,735 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 09:01:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 09:01:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:01:44,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:44,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:01:44,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-28 09:01:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:44,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919692689] [2022-04-28 09:01:44,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:01:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-28 09:01:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:44,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117480551] [2022-04-28 09:01:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:44,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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(36, 2); {149#true} is VALID [2022-04-28 09:01:44,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:01:44,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 09:01:44,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:44,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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(36, 2); {149#true} is VALID [2022-04-28 09:01:44,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 09:01:44,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 09:01:44,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-28 09:01:44,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:44,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:44,818 INFO L272 TraceCheckUtils]: 7: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:44,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:44,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-28 09:01:44,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 09:01:44,819 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 09:01:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:44,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117480551] [2022-04-28 09:01:44,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117480551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:44,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:44,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:44,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:44,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919692689] [2022-04-28 09:01:44,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919692689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:44,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:44,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087237064] [2022-04-28 09:01:44,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:44,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,830 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 09:01:44,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:01:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:01:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:01:44,831 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,960 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:01:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:01:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 09:01:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-28 09:01:44,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-28 09:01:44,980 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 09:01:44,981 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:01:44,981 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:01:44,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:01:44,982 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:44,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:01:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:01:44,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:44,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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 09:01:44,986 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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 09:01:44,986 INFO L87 Difference]: Start difference. First operand 15 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 09:01:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,987 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:01:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:01:44,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:44,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:44,988 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 15 states. [2022-04-28 09:01:44,988 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 15 states. [2022-04-28 09:01:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:44,989 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:01:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:01:44,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:44,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:44,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:44,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:44,989 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 09:01:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 09:01:44,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 09:01:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:44,990 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 09:01:44,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 09:01:44,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 09:01:45,012 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 09:01:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:01:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:01:45,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:45,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:01:45,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-28 09:01:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:45,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624977222] [2022-04-28 09:01:45,030 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:45,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 2 times [2022-04-28 09:01:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346375237] [2022-04-28 09:01:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:45,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(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(36, 2); {266#true} is VALID [2022-04-28 09:01:45,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 09:01:45,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-28 09:01:45,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:45,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(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(36, 2); {266#true} is VALID [2022-04-28 09:01:45,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-28 09:01:45,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-28 09:01:45,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret3 := main(); {266#true} is VALID [2022-04-28 09:01:45,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {271#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:45,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {271#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:45,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(= (+ (- 1) main_~i~0) 0)} assume 4 == ~i~0;~sn~0 := -10; {267#false} is VALID [2022-04-28 09:01:45,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {267#false} is VALID [2022-04-28 09:01:45,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#false} assume !(~i~0 <= ~n~0); {267#false} is VALID [2022-04-28 09:01:45,117 INFO L272 TraceCheckUtils]: 10: Hoare triple {267#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {267#false} is VALID [2022-04-28 09:01:45,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-04-28 09:01:45,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#false} assume 0 == ~cond; {267#false} is VALID [2022-04-28 09:01:45,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-28 09:01:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:45,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:45,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346375237] [2022-04-28 09:01:45,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346375237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:45,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:45,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:45,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624977222] [2022-04-28 09:01:45,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624977222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:45,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:45,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:01:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304205908] [2022-04-28 09:01:45,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:45,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:45,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,131 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 09:01:45,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:01:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:01:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:01:45,132 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:45,179 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 09:01:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:01:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 09:01:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 09:01:45,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 09:01:45,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:45,210 INFO L225 Difference]: With dead ends: 25 [2022-04-28 09:01:45,210 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:01:45,211 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 09:01:45,213 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:45,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:01:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 09:01:45,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:45,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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 09:01:45,224 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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 09:01:45,226 INFO L87 Difference]: Start difference. First operand 17 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 09:01:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:45,228 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:01:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:01:45,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:45,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:45,229 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 17 states. [2022-04-28 09:01:45,229 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 17 states. [2022-04-28 09:01:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:45,232 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 09:01:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 09:01:45,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:45,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:45,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:45,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:45,234 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 09:01:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 09:01:45,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-28 09:01:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:45,238 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 09:01:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 09:01:45,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 09:01:45,252 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 09:01:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 09:01:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:01:45,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:45,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:45,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:01:45,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2022-04-28 09:01:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:45,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080565409] [2022-04-28 09:01:45,263 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:45,263 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 2 times [2022-04-28 09:01:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948694653] [2022-04-28 09:01:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:45,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#(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(36, 2); {393#true} is VALID [2022-04-28 09:01:45,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 09:01:45,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-28 09:01:45,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:45,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#(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(36, 2); {393#true} is VALID [2022-04-28 09:01:45,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 09:01:45,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-28 09:01:45,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-28 09:01:45,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {398#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:45,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {399#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-28 09:01:45,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} assume !(4 == ~i~0); {399#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-28 09:01:45,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {400#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:45,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {401#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:45,459 INFO L272 TraceCheckUtils]: 10: Hoare triple {401#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:45,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {403#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:45,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {403#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {394#false} is VALID [2022-04-28 09:01:45,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 09:01:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:45,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948694653] [2022-04-28 09:01:45,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948694653] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:45,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079004777] [2022-04-28 09:01:45,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:45,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:45,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:45,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:01:45,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:45,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:45,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:01:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:45,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:45,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-28 09:01:45,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {393#true} is VALID [2022-04-28 09:01:45,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 09:01:45,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-28 09:01:45,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-28 09:01:45,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {398#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:45,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {426#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:45,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} assume !(4 == ~i~0); {426#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:45,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {433#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:01:45,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} assume !(~i~0 <= ~n~0); {437#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} is VALID [2022-04-28 09:01:45,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {437#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {441#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:45,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:45,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-28 09:01:45,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 09:01:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:45,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:46,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 09:01:46,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-28 09:01:46,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:46,099 INFO L272 TraceCheckUtils]: 10: Hoare triple {461#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {441#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:46,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {461#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:46,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {465#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:46,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(4 == ~i~0); {469#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:46,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {469#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:46,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {476#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:46,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-28 09:01:46,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-28 09:01:46,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 09:01:46,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {393#true} is VALID [2022-04-28 09:01:46,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-28 09:01:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079004777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:46,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 09:01:46,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080565409] [2022-04-28 09:01:46,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080565409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:46,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:46,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:01:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61369508] [2022-04-28 09:01:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:46,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,113 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 09:01:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:01:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:46,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:01:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:01:46,114 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,294 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 09:01:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:01:46,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 09:01:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-28 09:01:46,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-28 09:01:46,308 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 09:01:46,309 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:01:46,309 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:01:46,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:01:46,323 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:46,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:01:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:01:46,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:46,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 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 09:01:46,336 INFO L74 IsIncluded]: Start isIncluded. First operand 18 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 09:01:46,337 INFO L87 Difference]: Start difference. First operand 18 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 09:01:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,337 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 09:01:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:01:46,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,338 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 18 states. [2022-04-28 09:01:46,338 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 18 states. [2022-04-28 09:01:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,339 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 09:01:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:01:46,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:46,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:46,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 09:01:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 09:01:46,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-28 09:01:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:46,340 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 09:01:46,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 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 09:01:46,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 09:01:46,355 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 09:01:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 09:01:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:01:46,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:46,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:46,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:46,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:46,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2022-04-28 09:01:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714882095] [2022-04-28 09:01:46,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:46,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 2 times [2022-04-28 09:01:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:46,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468200567] [2022-04-28 09:01:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:46,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#(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(36, 2); {627#true} is VALID [2022-04-28 09:01:46,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-28 09:01:46,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-28 09:01:46,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:46,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#(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(36, 2); {627#true} is VALID [2022-04-28 09:01:46,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-28 09:01:46,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-28 09:01:46,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-28 09:01:46,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {632#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:46,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {632#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {632#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:46,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {632#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {632#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:46,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {632#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {633#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {628#false} is VALID [2022-04-28 09:01:46,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {628#false} is VALID [2022-04-28 09:01:46,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-28 09:01:46,610 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {628#false} is VALID [2022-04-28 09:01:46,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-28 09:01:46,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-28 09:01:46,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-28 09:01:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468200567] [2022-04-28 09:01:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468200567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181460387] [2022-04-28 09:01:46,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:01:46,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:46,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:46,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:46,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:01:46,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:01:46,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:46,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 09:01:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:46,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:46,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2022-04-28 09:01:46,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {627#true} is VALID [2022-04-28 09:01:46,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-28 09:01:46,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-28 09:01:46,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-28 09:01:46,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {653#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:46,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {653#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:46,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(<= main_~i~0 1)} assume !(4 == ~i~0); {653#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:46,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {633#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {628#false} is VALID [2022-04-28 09:01:46,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {628#false} is VALID [2022-04-28 09:01:46,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-28 09:01:46,718 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {628#false} is VALID [2022-04-28 09:01:46,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-28 09:01:46,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-28 09:01:46,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-28 09:01:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:46,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:46,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-28 09:01:46,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-28 09:01:46,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-28 09:01:46,765 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {628#false} is VALID [2022-04-28 09:01:46,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-28 09:01:46,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {628#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {628#false} is VALID [2022-04-28 09:01:46,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {705#(not (<= 4 main_~i~0))} assume 4 == ~i~0;~sn~0 := -10; {628#false} is VALID [2022-04-28 09:01:46,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(not (<= 4 main_~i~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {705#(not (<= 4 main_~i~0))} is VALID [2022-04-28 09:01:46,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {633#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {705#(not (<= 4 main_~i~0))} is VALID [2022-04-28 09:01:46,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {633#(<= main_~i~0 2)} assume !(4 == ~i~0); {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {633#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {633#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:46,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-28 09:01:46,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-28 09:01:46,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-28 09:01:46,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {627#true} is VALID [2022-04-28 09:01:46,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2022-04-28 09:01:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181460387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:46,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 09:01:46,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714882095] [2022-04-28 09:01:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714882095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:46,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:01:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244813835] [2022-04-28 09:01:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:46,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,778 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 09:01:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:01:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:01:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:01:46,779 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,837 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 09:01:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:01:46,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 09:01:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 09:01:46,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 09:01:46,858 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 09:01:46,858 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:01:46,859 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:01:46,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:01:46,859 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:46,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:01:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 09:01:46,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:46,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 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 09:01:46,868 INFO L74 IsIncluded]: Start isIncluded. First operand 20 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 09:01:46,869 INFO L87 Difference]: Start difference. First operand 20 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 09:01:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,869 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:01:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:01:46,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,870 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 20 states. [2022-04-28 09:01:46,870 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 20 states. [2022-04-28 09:01:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:46,871 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 09:01:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 09:01:46,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:46,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:46,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:46,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:46,871 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 09:01:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 09:01:46,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-04-28 09:01:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:46,872 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 09:01:46,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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 09:01:46,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 09:01:46,882 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 09:01:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:01:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:01:46,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:46,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:46,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:47,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1855275500, now seen corresponding path program 3 times [2022-04-28 09:01:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2093180110] [2022-04-28 09:01:47,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:47,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1855275500, now seen corresponding path program 4 times [2022-04-28 09:01:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:47,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494623755] [2022-04-28 09:01:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(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(36, 2); {876#true} is VALID [2022-04-28 09:01:47,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-28 09:01:47,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-28 09:01:47,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:47,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(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(36, 2); {876#true} is VALID [2022-04-28 09:01:47,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-28 09:01:47,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-28 09:01:47,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-28 09:01:47,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {881#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:47,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:47,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:47,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {883#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-28 09:01:47,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {884#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:47,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} assume !(4 == ~i~0); {884#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:47,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {885#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:47,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {886#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:47,227 INFO L272 TraceCheckUtils]: 13: Hoare triple {886#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:47,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {888#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:47,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {888#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {877#false} is VALID [2022-04-28 09:01:47,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-28 09:01:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494623755] [2022-04-28 09:01:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494623755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760095392] [2022-04-28 09:01:47,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:47,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:47,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:47,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:01:47,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:47,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:47,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:01:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:47,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:47,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {876#true} is VALID [2022-04-28 09:01:47,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {876#true} is VALID [2022-04-28 09:01:47,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-28 09:01:47,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-28 09:01:47,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-28 09:01:47,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {881#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:47,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:47,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:47,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {917#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:47,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {917#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {921#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:01:47,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {921#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} assume !(4 == ~i~0); {921#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 09:01:47,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {928#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} is VALID [2022-04-28 09:01:47,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {928#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} assume !(~i~0 <= ~n~0); {932#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} is VALID [2022-04-28 09:01:47,580 INFO L272 TraceCheckUtils]: 13: Hoare triple {932#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {936#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:47,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:47,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {877#false} is VALID [2022-04-28 09:01:47,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-28 09:01:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:47,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:47,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-28 09:01:47,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {877#false} is VALID [2022-04-28 09:01:47,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:47,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {956#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {936#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:47,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {956#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:47,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {960#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:47,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(4 == ~i~0); {964#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:47,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {964#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:47,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {971#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:47,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} assume !(4 == ~i~0); {975#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:47,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {982#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {975#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:47,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {982#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:47,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-28 09:01:47,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-28 09:01:47,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-28 09:01:47,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {876#true} is VALID [2022-04-28 09:01:47,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {876#true} is VALID [2022-04-28 09:01:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:47,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760095392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:47,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 09:01:47,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2093180110] [2022-04-28 09:01:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2093180110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:47,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:01:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006151390] [2022-04-28 09:01:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:47,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:47,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:47,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:47,872 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 09:01:47,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:01:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:01:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:01:47,873 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,151 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 09:01:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:01:48,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-04-28 09:01:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-04-28 09:01:48,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 27 transitions. [2022-04-28 09:01:48,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:48,173 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:01:48,173 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:01:48,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:01:48,174 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:48,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:01:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 09:01:48,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:48,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 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 09:01:48,201 INFO L74 IsIncluded]: Start isIncluded. First operand 21 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 09:01:48,202 INFO L87 Difference]: Start difference. First operand 21 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 09:01:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,202 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 09:01:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:01:48,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:48,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:48,203 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 21 states. [2022-04-28 09:01:48,203 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 21 states. [2022-04-28 09:01:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,204 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 09:01:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:01:48,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:48,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:48,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:48,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:48,204 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 09:01:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 09:01:48,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2022-04-28 09:01:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:48,205 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 09:01:48,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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 09:01:48,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 09:01:48,218 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 09:01:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:01:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:01:48,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:48,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:48,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 09:01:48,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:48,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 3 times [2022-04-28 09:01:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:48,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505109115] [2022-04-28 09:01:48,430 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:48,430 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 4 times [2022-04-28 09:01:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:48,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105452228] [2022-04-28 09:01:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:48,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1163#(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(36, 2); {1155#true} is VALID [2022-04-28 09:01:48,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 09:01:48,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-28 09:01:48,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:48,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1163#(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(36, 2); {1155#true} is VALID [2022-04-28 09:01:48,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 09:01:48,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-28 09:01:48,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-28 09:01:48,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1160#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:48,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1160#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:48,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {1160#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:01:48,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1162#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-28 09:01:48,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {1156#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L272 TraceCheckUtils]: 16: Hoare triple {1156#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 09:01:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105452228] [2022-04-28 09:01:48,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105452228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233310965] [2022-04-28 09:01:48,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:01:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:48,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:48,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:48,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:01:48,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:01:48,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:48,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:01:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:48,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-28 09:01:48,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {1155#true} is VALID [2022-04-28 09:01:48,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 09:01:48,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-28 09:01:48,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-28 09:01:48,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(<= main_~i~0 1)} assume !(4 == ~i~0); {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1182#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {1162#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-28 09:01:48,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {1156#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1156#false} is VALID [2022-04-28 09:01:48,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-28 09:01:48,582 INFO L272 TraceCheckUtils]: 16: Hoare triple {1156#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1156#false} is VALID [2022-04-28 09:01:48,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-28 09:01:48,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 09:01:48,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 09:01:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:48,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:48,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-28 09:01:48,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-28 09:01:48,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-28 09:01:48,643 INFO L272 TraceCheckUtils]: 16: Hoare triple {1156#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1156#false} is VALID [2022-04-28 09:01:48,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-28 09:01:48,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1156#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1156#false} is VALID [2022-04-28 09:01:48,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-28 09:01:48,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1162#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1162#(<= main_~i~0 3)} is VALID [2022-04-28 09:01:48,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1182#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1161#(<= main_~i~0 2)} is VALID [2022-04-28 09:01:48,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(<= main_~i~0 1)} assume !(4 == ~i~0); {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1182#(<= main_~i~0 1)} is VALID [2022-04-28 09:01:48,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-28 09:01:48,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-28 09:01:48,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-28 09:01:48,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {1155#true} is VALID [2022-04-28 09:01:48,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-28 09:01:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233310965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:48,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:48,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-28 09:01:48,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505109115] [2022-04-28 09:01:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505109115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:48,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:48,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:01:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263929477] [2022-04-28 09:01:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:48,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,663 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 09:01:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:01:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:01:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:01:48,663 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,731 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 09:01:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:01:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-28 09:01:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-28 09:01:48,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-28 09:01:48,765 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 09:01:48,765 INFO L225 Difference]: With dead ends: 31 [2022-04-28 09:01:48,765 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:01:48,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:01:48,766 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:48,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:01:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:01:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 09:01:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:48,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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 09:01:48,781 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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 09:01:48,781 INFO L87 Difference]: Start difference. First operand 23 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 09:01:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,782 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 09:01:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 09:01:48,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:48,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:48,783 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 23 states. [2022-04-28 09:01:48,783 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 23 states. [2022-04-28 09:01:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:48,783 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 09:01:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 09:01:48,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:48,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:48,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:48,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:48,784 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 09:01:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-28 09:01:48,784 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-04-28 09:01:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:48,785 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-28 09:01:48,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 09:01:48,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-28 09:01:48,801 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 09:01:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:01:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:01:48,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:48,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:48,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 09:01:49,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:49,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1902707051, now seen corresponding path program 5 times [2022-04-28 09:01:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:49,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512379677] [2022-04-28 09:01:49,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:49,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1902707051, now seen corresponding path program 6 times [2022-04-28 09:01:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:49,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216234317] [2022-04-28 09:01:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:01:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:49,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1456#(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(36, 2); {1442#true} is VALID [2022-04-28 09:01:49,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 09:01:49,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-28 09:01:49,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:01:49,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#(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(36, 2); {1442#true} is VALID [2022-04-28 09:01:49,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 09:01:49,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-28 09:01:49,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-28 09:01:49,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1447#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:49,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {1447#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:49,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:49,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1449#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-28 09:01:49,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1449#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1450#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:49,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1450#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} assume !(4 == ~i~0); {1450#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:49,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {1450#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1449#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-28 09:01:49,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1451#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:49,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} assume !(4 == ~i~0); {1451#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:49,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1452#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-28 09:01:49,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1452#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {1453#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:49,167 INFO L272 TraceCheckUtils]: 16: Hoare triple {1453#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:01:49,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {1454#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1455#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:01:49,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {1455#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1443#false} is VALID [2022-04-28 09:01:49,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 09:01:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:01:49,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:01:49,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216234317] [2022-04-28 09:01:49,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216234317] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:01:49,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003622779] [2022-04-28 09:01:49,169 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:01:49,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:01:49,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:01:49,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:01:49,244 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:01:49,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:01:49,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:01:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:01:49,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:01:49,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1442#true} is VALID [2022-04-28 09:01:49,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {1442#true} is VALID [2022-04-28 09:01:49,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 09:01:49,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-28 09:01:49,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-28 09:01:49,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1447#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:01:49,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {1447#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:49,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:49,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {1448#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1484#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:01:49,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {1484#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1488#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-28 09:01:49,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {1488#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} assume !(4 == ~i~0); {1488#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-28 09:01:49,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1495#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:01:49,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1495#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1499#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:01:49,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} assume !(4 == ~i~0); {1499#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-28 09:01:49,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1506#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-28 09:01:49,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {1506#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {1510#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-28 09:01:49,642 INFO L272 TraceCheckUtils]: 16: Hoare triple {1510#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:49,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:49,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {1518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1443#false} is VALID [2022-04-28 09:01:49,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 09:01:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:49,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:01:50,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 09:01:50,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {1518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1443#false} is VALID [2022-04-28 09:01:50,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:01:50,029 INFO L272 TraceCheckUtils]: 16: Hoare triple {1534#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:01:50,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1538#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {1534#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:50,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1538#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:50,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(4 == ~i~0); {1542#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:50,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {1549#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1542#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 09:01:50,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1553#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1549#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:50,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {1553#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} assume !(4 == ~i~0); {1553#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:50,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1553#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-28 09:01:50,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1564#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1560#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:50,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1564#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !(4 == ~i~0); {1564#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:50,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {1564#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-28 09:01:50,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1571#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-28 09:01:50,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-28 09:01:50,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-28 09:01:50,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 09:01:50,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2); {1442#true} is VALID [2022-04-28 09:01:50,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1442#true} is VALID [2022-04-28 09:01:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:01:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003622779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:01:50,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:01:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-28 09:01:50,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:01:50,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512379677] [2022-04-28 09:01:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512379677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:01:50,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:01:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:01:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359802993] [2022-04-28 09:01:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:01:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 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 09:01:50,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:01:50,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 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 09:01:50,052 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 09:01:50,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:01:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:50,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:01:50,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:01:50,054 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 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 09:01:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:50,395 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:01:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:01:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 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 09:01:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:01:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 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 09:01:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 09:01:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 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 09:01:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-28 09:01:50,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-28 09:01:50,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:50,418 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:01:50,418 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 09:01:50,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:01:50,419 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:01:50,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:01:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 09:01:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 09:01:50,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:01:50,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,445 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,445 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:50,446 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 09:01:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 09:01:50,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:50,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:50,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,447 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:01:50,448 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 09:01:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 09:01:50,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:01:50,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:01:50,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:01:50,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:01:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 09:01:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 09:01:50,449 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-28 09:01:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:01:50,449 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 09:01:50,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 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 09:01:50,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 09:01:50,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:01:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 09:01:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:01:50,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:01:50,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:01:50,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:01:50,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:01:50,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:01:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:01:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 5 times [2022-04-28 09:01:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:01:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839181735] [2022-04-28 09:01:50,691 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:01:50,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:01:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 6 times [2022-04-28 09:01:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:01:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191113974] [2022-04-28 09:01:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:01:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:01:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:01:50,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:01:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:01:50,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:01:50,738 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:01:50,738 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:01:50,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:01:50,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 09:01:50,743 INFO L356 BasicCegarLoop]: Path program histogram: [6, 6, 2, 2, 2] [2022-04-28 09:01:50,745 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 09:01:50,752 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:01:50,753 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:01:50,754 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:01:50,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:01:50 BoogieIcfgContainer [2022-04-28 09:01:50,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:01:50,755 INFO L158 Benchmark]: Toolchain (without parser) took 7016.61ms. Allocated memory was 205.5MB in the beginning and 307.2MB in the end (delta: 101.7MB). Free memory was 151.9MB in the beginning and 247.6MB in the end (delta: -95.7MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-04-28 09:01:50,755 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:01:50,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.53ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 178.1MB in the end (delta: -26.4MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2022-04-28 09:01:50,755 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 205.5MB. Free memory was 178.1MB in the beginning and 176.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:01:50,756 INFO L158 Benchmark]: RCFGBuilder took 224.44ms. Allocated memory is still 205.5MB. Free memory was 176.5MB in the beginning and 166.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:01:50,756 INFO L158 Benchmark]: TraceAbstraction took 6519.85ms. Allocated memory was 205.5MB in the beginning and 307.2MB in the end (delta: 101.7MB). Free memory was 165.6MB in the beginning and 247.6MB in the end (delta: -82.0MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2022-04-28 09:01:50,757 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.13ms. Allocated memory is still 205.5MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.53ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 178.1MB in the end (delta: -26.4MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 205.5MB. Free memory was 178.1MB in the beginning and 176.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.44ms. Allocated memory is still 205.5MB. Free memory was 176.5MB in the beginning and 166.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6519.85ms. Allocated memory was 205.5MB in the beginning and 307.2MB in the end (delta: 101.7MB). Free memory was 165.6MB in the beginning and 247.6MB in the end (delta: -82.0MB). Peak memory consumption was 20.5MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND TRUE i==4 [L26] sn=-10 [L24] i++ [L24] COND FALSE !(i<=n) [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 97 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 09:01:50,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...