/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-34549b5 [2022-04-08 09:01:01,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:01:01,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:01:01,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:01:01,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:01:01,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:01:01,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:01:01,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:01:01,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:01:01,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:01:01,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:01:01,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:01:01,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:01:01,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:01:01,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:01:01,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:01:01,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:01:01,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:01:01,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:01:01,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:01:01,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:01:01,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:01:01,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:01:01,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:01:01,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:01:01,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:01:01,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:01:01,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:01:01,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:01:01,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:01:01,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:01:01,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:01:01,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:01:01,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:01:01,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:01:01,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:01:01,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:01:01,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:01:01,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:01:01,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:01:01,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:01:01,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:01:01,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:01:01,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:01:01,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:01:01,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:01:01,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:01:01,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:01,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:01:01,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:01:01,124 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:01:01,124 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:01:01,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:01:01,124 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:01:01,124 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:01:01,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:01:01,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:01:01,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:01:01,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:01:01,337 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:01:01,338 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-08 09:01:01,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e81982b/a299bd0025274b8c8d50b491d113d938/FLAG90a5be3b8 [2022-04-08 09:01:01,722 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:01:01,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-08 09:01:01,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e81982b/a299bd0025274b8c8d50b491d113d938/FLAG90a5be3b8 [2022-04-08 09:01:01,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e81982b/a299bd0025274b8c8d50b491d113d938 [2022-04-08 09:01:01,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:01:01,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:01:01,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:01,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:01:01,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:01:01,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:01,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f999466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01, skipping insertion in model container [2022-04-08 09:01:01,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:01,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:01:01,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:01:01,900 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-08 09:01:01,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:01,946 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:01:01,965 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-08 09:01:01,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:01:01,983 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:01:01,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01 WrapperNode [2022-04-08 09:01:01,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:01:01,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:01:01,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:01:01,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:01:01,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:01,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:01:02,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:01:02,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:01:02,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:01:02,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (1/1) ... [2022-04-08 09:01:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:01:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:02,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:01:02,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:01:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:01:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:01:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:01:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:01:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:01:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:01:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:01:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:01:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:01:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:01:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:01:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:01:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:01:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:01:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:01:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:01:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:01:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:01:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:01:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:01:02,150 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:01:02,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:01:02,262 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:01:02,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:01:02,267 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:01:02,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:02 BoogieIcfgContainer [2022-04-08 09:01:02,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:01:02,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:01:02,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:01:02,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:01:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:01:01" (1/3) ... [2022-04-08 09:01:02,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0dc138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:02, skipping insertion in model container [2022-04-08 09:01:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:01:01" (2/3) ... [2022-04-08 09:01:02,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0dc138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:01:02, skipping insertion in model container [2022-04-08 09:01:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:01:02" (3/3) ... [2022-04-08 09:01:02,273 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2022-04-08 09:01:02,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:01:02,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:01:02,341 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:01:02,345 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:01:02,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:01:02,385 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-08 09:01:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:01:02,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:02,399 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:02,400 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-08 09:01:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188555047] [2022-04-08 09:01:02,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:01:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-08 09:01:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:02,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264137346] [2022-04-08 09:01:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:02,593 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-08 09:01:02,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:02,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:01:02,595 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-08 09:01:02,595 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-08 09:01:02,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:01:02,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:01:02,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-08 09:01:02,596 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-08 09:01:02,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 09:01:02,597 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-08 09:01:02,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 09:01:02,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:01:02,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:01:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:02,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264137346] [2022-04-08 09:01:02,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264137346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:02,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:02,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:01:02,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1188555047] [2022-04-08 09:01:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1188555047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:02,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:02,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:01:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308153856] [2022-04-08 09:01:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:02,606 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-08 09:01:02,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:02,609 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-08 09:01:02,626 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-08 09:01:02,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:01:02,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:02,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:01:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:01:02,650 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-08 09:01:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:02,728 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-08 09:01:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:01:02,729 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-08 09:01:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:02,730 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-08 09:01:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:01:02,734 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-08 09:01:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:01:02,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-08 09:01:02,792 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-08 09:01:02,797 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:01:02,798 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:01:02,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:01:02,801 INFO L913 BasicCegarLoop]: 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-08 09:01:02,802 INFO L914 BasicCegarLoop]: 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-08 09:01:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:01:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:01:02,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:02,822 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-08 09:01:02,823 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-08 09:01:02,823 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-08 09:01:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:02,832 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:01:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:02,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:02,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:02,836 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-08 09:01:02,836 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-08 09:01:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:02,840 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:01:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:02,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:02,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:02,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:02,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:02,841 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-08 09:01:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 09:01:02,842 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 09:01:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:02,843 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 09:01:02,843 INFO L479 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-08 09:01:02,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 09:01:02,862 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-08 09:01:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:01:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:01:02,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:02,866 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:02,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:01:02,869 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-08 09:01:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:02,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661115399] [2022-04-08 09:01:02,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:01:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-08 09:01:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:02,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328800213] [2022-04-08 09:01:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:02,955 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-08 09:01:02,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:01:02,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:01:02,956 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-08 09:01:02,956 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-08 09:01:02,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:01:02,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:01:02,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-08 09:01:02,957 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-08 09:01:02,958 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-08 09:01:02,959 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-08 09:01:02,959 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-08 09:01:02,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:01:02,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:01:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328800213] [2022-04-08 09:01:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328800213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:02,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:02,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:01:02,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661115399] [2022-04-08 09:01:02,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661115399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:02,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:02,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:01:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444264461] [2022-04-08 09:01:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:02,962 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-08 09:01:02,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:02,962 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-08 09:01:02,970 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-08 09:01:02,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:01:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:01:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:01:02,971 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-08 09:01:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,077 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:01:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:01:03,077 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-08 09:01:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:03,077 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-08 09:01:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-08 09:01:03,085 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-08 09:01:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-08 09:01:03,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-08 09:01:03,104 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-08 09:01:03,106 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:01:03,106 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:01:03,106 INFO L912 BasicCegarLoop]: 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-08 09:01:03,107 INFO L913 BasicCegarLoop]: 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-08 09:01:03,108 INFO L914 BasicCegarLoop]: 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-08 09:01:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:01:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:01:03,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:03,113 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-08 09:01:03,113 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-08 09:01:03,113 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-08 09:01:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,120 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 09:01:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:01:03,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,120 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-08 09:01:03,120 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-08 09:01:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,121 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 09:01:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:01:03,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:03,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:03,122 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-08 09:01:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 09:01:03,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-08 09:01:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:03,123 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 09:01:03,123 INFO L479 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-08 09:01:03,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 09:01:03,136 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-08 09:01:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 09:01:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:01:03,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:03,137 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:03,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:01:03,139 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-08 09:01:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:03,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217440488] [2022-04-08 09:01:03,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:03,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 2 times [2022-04-08 09:01:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375496996] [2022-04-08 09:01:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:03,220 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-08 09:01:03,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-08 09:01:03,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-08 09:01:03,221 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-08 09:01:03,221 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-08 09:01:03,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-08 09:01:03,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-08 09:01:03,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret3 := main(); {266#true} is VALID [2022-04-08 09:01:03,222 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-08 09:01:03,223 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-08 09:01:03,226 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-08 09:01:03,226 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-08 09:01:03,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#false} assume !(~i~0 <= ~n~0); {267#false} is VALID [2022-04-08 09:01:03,228 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-08 09:01:03,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-04-08 09:01:03,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#false} assume 0 == ~cond; {267#false} is VALID [2022-04-08 09:01:03,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-08 09:01:03,228 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-08 09:01:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375496996] [2022-04-08 09:01:03,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375496996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:03,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:03,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:01:03,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217440488] [2022-04-08 09:01:03,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217440488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:03,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:03,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:01:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469031829] [2022-04-08 09:01:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:03,230 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-08 09:01:03,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:03,230 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-08 09:01:03,240 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-08 09:01:03,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:01:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:01:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:01:03,242 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-08 09:01:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,299 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 09:01:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:01:03,300 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-08 09:01:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:03,300 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-08 09:01:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 09:01:03,303 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-08 09:01:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 09:01:03,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 09:01:03,325 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-08 09:01:03,326 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:01:03,326 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:01:03,326 INFO L912 BasicCegarLoop]: 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-08 09:01:03,329 INFO L913 BasicCegarLoop]: 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-08 09:01:03,333 INFO L914 BasicCegarLoop]: 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-08 09:01:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:01:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 09:01:03,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:03,339 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-08 09:01:03,339 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-08 09:01:03,341 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-08 09:01:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,342 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 09:01:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 09:01:03,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,342 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-08 09:01:03,343 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-08 09:01:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:03,344 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 09:01:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 09:01:03,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:03,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:03,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:03,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:03,344 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-08 09:01:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-08 09:01:03,345 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-08 09:01:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:03,345 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-08 09:01:03,346 INFO L479 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-08 09:01:03,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-08 09:01:03,367 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-08 09:01:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 09:01:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:01:03,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:03,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:03,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:01:03,368 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2022-04-08 09:01:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:03,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727210961] [2022-04-08 09:01:03,375 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:03,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 2 times [2022-04-08 09:01:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:03,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976555601] [2022-04-08 09:01:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:03,579 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-08 09:01:03,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 09:01:03,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-08 09:01:03,585 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-08 09:01:03,585 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-08 09:01:03,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 09:01:03,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-08 09:01:03,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-08 09:01:03,586 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-08 09:01:03,587 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-08 09:01:03,588 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-08 09:01:03,588 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-08 09:01:03,589 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-08 09:01:03,589 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-08 09:01:03,590 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-08 09:01:03,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {403#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {394#false} is VALID [2022-04-08 09:01:03,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 09:01:03,591 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-08 09:01:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976555601] [2022-04-08 09:01:03,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976555601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365035924] [2022-04-08 09:01:03,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:03,592 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-08 09:01:03,594 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-08 09:01:03,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:03,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:03,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:01:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:03,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:03,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-08 09:01:03,978 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-08 09:01:03,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 09:01:03,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-08 09:01:03,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-08 09:01:03,978 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-08 09:01:03,980 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-08 09:01:03,980 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-08 09:01:03,980 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-08 09:01:03,981 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-08 09:01:03,982 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-08 09:01:03,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:03,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-08 09:01:03,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 09:01:03,983 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-08 09:01:03,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:04,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 09:01:04,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-08 09:01:04,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:04,243 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-08 09:01:04,243 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-08 09:01:04,244 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-08 09:01:04,245 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-08 09:01:04,246 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-08 09:01:04,248 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-08 09:01:04,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret3 := main(); {393#true} is VALID [2022-04-08 09:01:04,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #47#return; {393#true} is VALID [2022-04-08 09:01:04,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 09:01:04,249 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-08 09:01:04,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-08 09:01:04,250 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-08 09:01:04,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365035924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:04,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:04,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-08 09:01:04,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727210961] [2022-04-08 09:01:04,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727210961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:04,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:04,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:01:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3481946] [2022-04-08 09:01:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:04,253 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-08 09:01:04,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:04,254 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-08 09:01:04,279 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-08 09:01:04,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:01:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:01:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:01:04,280 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-08 09:01:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:04,478 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 09:01:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:01:04,478 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-08 09:01:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:04,479 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-08 09:01:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-08 09:01:04,480 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-08 09:01:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-08 09:01:04,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-08 09:01:04,501 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-08 09:01:04,501 INFO L225 Difference]: With dead ends: 23 [2022-04-08 09:01:04,501 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:01:04,502 INFO L912 BasicCegarLoop]: 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-08 09:01:04,502 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:04,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:01:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:01:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:01:04,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:04,509 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-08 09:01:04,510 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-08 09:01:04,510 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-08 09:01:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:04,510 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-08 09:01:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-08 09:01:04,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:04,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:04,511 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-08 09:01:04,511 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-08 09:01:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:04,512 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-08 09:01:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-08 09:01:04,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:04,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:04,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:04,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:04,512 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-08 09:01:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-08 09:01:04,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-08 09:01:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:04,513 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-08 09:01:04,513 INFO L479 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-08 09:01:04,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-08 09:01:04,527 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-08 09:01:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-08 09:01:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:01:04,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:04,528 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:04,559 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-08 09:01:04,744 WARN L460 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-08 09:01:04,744 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2022-04-08 09:01:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:04,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737840309] [2022-04-08 09:01:04,749 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:04,749 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 2 times [2022-04-08 09:01:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:04,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710325726] [2022-04-08 09:01:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:04,800 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-08 09:01:04,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-08 09:01:04,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-08 09:01:04,801 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-08 09:01:04,801 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-08 09:01:04,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-08 09:01:04,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-08 09:01:04,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-08 09:01:04,802 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-08 09:01:04,803 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-08 09:01:04,803 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-08 09:01:04,804 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-08 09:01:04,804 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-08 09:01:04,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {628#false} is VALID [2022-04-08 09:01:04,806 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-08 09:01:04,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-08 09:01:04,806 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-08 09:01:04,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-08 09:01:04,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-08 09:01:04,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-08 09:01:04,806 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-08 09:01:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710325726] [2022-04-08 09:01:04,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710325726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:04,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262230287] [2022-04-08 09:01:04,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:01:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:04,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:04,808 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-08 09:01:04,809 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-08 09:01:04,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:01:04,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:04,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:01:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:04,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:04,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2022-04-08 09:01:04,888 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-08 09:01:04,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-08 09:01:04,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-08 09:01:04,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-08 09:01:04,889 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-08 09:01:04,889 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-08 09:01:04,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(<= main_~i~0 1)} assume !(4 == ~i~0); {653#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:04,890 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-08 09:01:04,890 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-08 09:01:04,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {628#false} is VALID [2022-04-08 09:01:04,890 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-08 09:01:04,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-08 09:01:04,891 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-08 09:01:04,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-08 09:01:04,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-08 09:01:04,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-08 09:01:04,891 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-08 09:01:04,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:04,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-08 09:01:04,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#false} assume 0 == ~cond; {628#false} is VALID [2022-04-08 09:01:04,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2022-04-08 09:01:04,946 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-08 09:01:04,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !(~i~0 <= ~n~0); {628#false} is VALID [2022-04-08 09:01:04,946 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-08 09:01:04,946 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-08 09:01:04,946 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-08 09:01:04,947 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-08 09:01:04,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {633#(<= main_~i~0 2)} assume !(4 == ~i~0); {633#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:04,948 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-08 09:01:04,948 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-08 09:01:04,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-08 09:01:04,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #47#return; {627#true} is VALID [2022-04-08 09:01:04,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-08 09:01:04,948 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-08 09:01:04,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2022-04-08 09:01:04,949 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-08 09:01:04,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262230287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:04,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:04,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-08 09:01:04,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:04,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737840309] [2022-04-08 09:01:04,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737840309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:04,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:04,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:01:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028114044] [2022-04-08 09:01:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:04,950 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-08 09:01:04,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:04,950 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-08 09:01:04,961 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-08 09:01:04,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:01:04,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:01:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:01:04,962 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-08 09:01:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:05,033 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 09:01:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:01:05,033 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-08 09:01:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:05,033 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-08 09:01:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:01:05,034 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-08 09:01:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:01:05,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-08 09:01:05,055 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-08 09:01:05,055 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:01:05,055 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:01:05,056 INFO L912 BasicCegarLoop]: 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-08 09:01:05,056 INFO L913 BasicCegarLoop]: 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-08 09:01:05,056 INFO L914 BasicCegarLoop]: 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-08 09:01:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:01:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 09:01:05,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:05,064 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-08 09:01:05,064 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-08 09:01:05,065 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-08 09:01:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:05,065 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:01:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:01:05,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:05,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:05,066 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-08 09:01:05,066 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-08 09:01:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:05,067 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 09:01:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 09:01:05,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:05,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:05,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:05,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:05,067 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-08 09:01:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 09:01:05,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-04-08 09:01:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:05,068 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 09:01:05,068 INFO L479 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-08 09:01:05,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 09:01:05,083 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-08 09:01:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 09:01:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:01:05,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:05,083 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:05,103 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-08 09:01:05,303 WARN L460 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-08 09:01:05,303 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1855275500, now seen corresponding path program 3 times [2022-04-08 09:01:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:05,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941847761] [2022-04-08 09:01:05,307 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:05,307 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1855275500, now seen corresponding path program 4 times [2022-04-08 09:01:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:05,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585171370] [2022-04-08 09:01:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:05,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:05,430 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-08 09:01:05,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-08 09:01:05,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-08 09:01:05,430 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-08 09:01:05,430 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-08 09:01:05,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-08 09:01:05,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-08 09:01:05,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-08 09:01:05,431 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-08 09:01:05,432 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-08 09:01:05,432 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-08 09:01:05,433 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-08 09:01:05,433 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-08 09:01:05,434 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-08 09:01:05,434 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-08 09:01:05,435 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-08 09:01:05,436 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-08 09:01:05,436 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-08 09:01:05,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {888#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {877#false} is VALID [2022-04-08 09:01:05,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-08 09:01:05,437 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-08 09:01:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585171370] [2022-04-08 09:01:05,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585171370] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055645416] [2022-04-08 09:01:05,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:05,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:05,438 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-08 09:01:05,439 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-08 09:01:05,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:05,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:05,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 09:01:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:05,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:05,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {876#true} is VALID [2022-04-08 09:01:05,794 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-08 09:01:05,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-08 09:01:05,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-08 09:01:05,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-08 09:01:05,795 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-08 09:01:05,795 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-08 09:01:05,796 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-08 09:01:05,796 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-08 09:01:05,797 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-08 09:01:05,797 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-08 09:01:05,798 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-08 09:01:05,798 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-08 09:01:05,799 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-08 09:01:05,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:05,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {877#false} is VALID [2022-04-08 09:01:05,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-08 09:01:05,800 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-08 09:01:05,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:06,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#false} assume !false; {877#false} is VALID [2022-04-08 09:01:06,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {877#false} is VALID [2022-04-08 09:01:06,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:06,105 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-08 09:01:06,106 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-08 09:01:06,107 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-08 09:01:06,107 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-08 09:01:06,108 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-08 09:01:06,108 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-08 09:01:06,109 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-08 09:01:06,110 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-08 09:01:06,111 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-08 09:01:06,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} call #t~ret3 := main(); {876#true} is VALID [2022-04-08 09:01:06,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} #47#return; {876#true} is VALID [2022-04-08 09:01:06,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} assume true; {876#true} is VALID [2022-04-08 09:01:06,111 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-08 09:01:06,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} call ULTIMATE.init(); {876#true} is VALID [2022-04-08 09:01:06,111 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-08 09:01:06,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055645416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:06,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:06,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-08 09:01:06,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:06,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941847761] [2022-04-08 09:01:06,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941847761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:06,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:06,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:01:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648649700] [2022-04-08 09:01:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:06,112 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-08 09:01:06,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:06,112 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-08 09:01:06,126 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-08 09:01:06,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:01:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:01:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:01:06,127 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-08 09:01:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:06,437 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-08 09:01:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:01:06,437 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-08 09:01:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:06,437 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-08 09:01:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-04-08 09:01:06,438 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-08 09:01:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-04-08 09:01:06,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 27 transitions. [2022-04-08 09:01:06,460 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-08 09:01:06,461 INFO L225 Difference]: With dead ends: 26 [2022-04-08 09:01:06,461 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:01:06,461 INFO L912 BasicCegarLoop]: 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-08 09:01:06,462 INFO L913 BasicCegarLoop]: 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-08 09:01:06,462 INFO L914 BasicCegarLoop]: 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-08 09:01:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:01:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 09:01:06,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:06,478 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-08 09:01:06,478 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-08 09:01:06,478 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-08 09:01:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:06,479 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 09:01:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:01:06,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:06,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:06,479 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-08 09:01:06,479 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-08 09:01:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:06,480 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 09:01:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:01:06,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:06,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:06,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:06,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:06,480 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-08 09:01:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-08 09:01:06,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2022-04-08 09:01:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:06,481 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-08 09:01:06,481 INFO L479 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-08 09:01:06,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-08 09:01:06,500 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-08 09:01:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:01:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:01:06,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:06,500 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:06,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:06,717 WARN L460 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-08 09:01:06,717 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 3 times [2022-04-08 09:01:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1078655926] [2022-04-08 09:01:06,722 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:06,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 4 times [2022-04-08 09:01:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:06,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201794745] [2022-04-08 09:01:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:06,758 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-08 09:01:06,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-08 09:01:06,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-08 09:01:06,759 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-08 09:01:06,759 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-08 09:01:06,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-08 09:01:06,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-08 09:01:06,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-08 09:01:06,759 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-08 09:01:06,760 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-08 09:01:06,760 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-08 09:01:06,760 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-08 09:01:06,761 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-08 09:01:06,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:06,761 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-08 09:01:06,762 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-08 09:01:06,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-08 09:01:06,762 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-08 09:01:06,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-08 09:01:06,762 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-08 09:01:06,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-08 09:01:06,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-08 09:01:06,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-08 09:01:06,762 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-08 09:01:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201794745] [2022-04-08 09:01:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201794745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932153251] [2022-04-08 09:01:06,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:06,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:06,764 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-08 09:01:06,774 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-08 09:01:06,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:06,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:06,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:01:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:06,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:06,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-08 09:01:06,866 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-08 09:01:06,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-08 09:01:06,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-08 09:01:06,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-08 09:01:06,867 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-08 09:01:06,867 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-08 09:01:06,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(<= main_~i~0 1)} assume !(4 == ~i~0); {1182#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:06,868 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-08 09:01:06,868 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-08 09:01:06,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:06,869 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-08 09:01:06,869 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-08 09:01:06,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-08 09:01:06,869 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-08 09:01:06,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-08 09:01:06,870 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-08 09:01:06,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-08 09:01:06,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-08 09:01:06,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-08 09:01:06,870 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-08 09:01:06,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:06,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-08 09:01:06,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2022-04-08 09:01:06,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2022-04-08 09:01:06,933 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-08 09:01:06,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1156#false} assume !(~i~0 <= ~n~0); {1156#false} is VALID [2022-04-08 09:01:06,933 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-08 09:01:06,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {1156#false} is VALID [2022-04-08 09:01:06,934 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-08 09:01:06,934 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-08 09:01:06,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 2)} assume !(4 == ~i~0); {1161#(<= main_~i~0 2)} is VALID [2022-04-08 09:01:06,935 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-08 09:01:06,935 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-08 09:01:06,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(<= main_~i~0 1)} assume !(4 == ~i~0); {1182#(<= main_~i~0 1)} is VALID [2022-04-08 09:01:06,936 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-08 09:01:06,936 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-08 09:01:06,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret3 := main(); {1155#true} is VALID [2022-04-08 09:01:06,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #47#return; {1155#true} is VALID [2022-04-08 09:01:06,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-08 09:01:06,936 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-08 09:01:06,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2022-04-08 09:01:06,937 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-08 09:01:06,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932153251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:06,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:06,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-08 09:01:06,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:06,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1078655926] [2022-04-08 09:01:06,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1078655926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:06,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:06,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:01:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731427271] [2022-04-08 09:01:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:06,938 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-08 09:01:06,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:06,938 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-08 09:01:06,949 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-08 09:01:06,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:01:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:01:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:01:06,950 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-08 09:01:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:07,023 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 09:01:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:01:07,023 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-08 09:01:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:07,023 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-08 09:01:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:01:07,024 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-08 09:01:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:01:07,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-08 09:01:07,050 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-08 09:01:07,050 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:01:07,050 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:01:07,051 INFO L912 BasicCegarLoop]: 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-08 09:01:07,051 INFO L913 BasicCegarLoop]: 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-08 09:01:07,051 INFO L914 BasicCegarLoop]: 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-08 09:01:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:01:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 09:01:07,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:07,083 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-08 09:01:07,083 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-08 09:01:07,083 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-08 09:01:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:07,084 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 09:01:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 09:01:07,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:07,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:07,085 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-08 09:01:07,085 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-08 09:01:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:07,085 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 09:01:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 09:01:07,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:07,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:07,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:07,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:07,086 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-08 09:01:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-08 09:01:07,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-04-08 09:01:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:07,087 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-08 09:01:07,087 INFO L479 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-08 09:01:07,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-08 09:01:07,104 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-08 09:01:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 09:01:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:01:07,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:07,105 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:07,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:01:07,319 WARN L460 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-08 09:01:07,319 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1902707051, now seen corresponding path program 5 times [2022-04-08 09:01:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:07,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875534381] [2022-04-08 09:01:07,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:07,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1902707051, now seen corresponding path program 6 times [2022-04-08 09:01:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:07,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464110395] [2022-04-08 09:01:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:07,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:07,512 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-08 09:01:07,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 09:01:07,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-08 09:01:07,513 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-08 09:01:07,513 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-08 09:01:07,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 09:01:07,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-08 09:01:07,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-08 09:01:07,514 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-08 09:01:07,514 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-08 09:01:07,515 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-08 09:01:07,515 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-08 09:01:07,516 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-08 09:01:07,516 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-08 09:01:07,517 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-08 09:01:07,517 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-08 09:01:07,518 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-08 09:01:07,518 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-08 09:01:07,519 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-08 09:01:07,520 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-08 09:01:07,520 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-08 09:01:07,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1455#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1443#false} is VALID [2022-04-08 09:01:07,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-08 09:01:07,521 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-08 09:01:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464110395] [2022-04-08 09:01:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464110395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103639878] [2022-04-08 09:01:07,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:01:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:07,522 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-08 09:01:07,539 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-08 09:01:07,564 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:01:07,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:07,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:01:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:07,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:07,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1442#true} is VALID [2022-04-08 09:01:07,996 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-08 09:01:07,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 09:01:07,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-08 09:01:07,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-08 09:01:07,997 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-08 09:01:07,997 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-08 09:01:07,998 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-08 09:01:07,998 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-08 09:01:07,999 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-08 09:01:07,999 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-08 09:01:08,000 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-08 09:01:08,000 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-08 09:01:08,001 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-08 09:01:08,001 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-08 09:01:08,002 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-08 09:01:08,002 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-08 09:01:08,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {1518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1443#false} is VALID [2022-04-08 09:01:08,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-08 09:01:08,003 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-08 09:01:08,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:08,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-08 09:01:08,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1443#false} is VALID [2022-04-08 09:01:08,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:08,422 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-08 09:01:08,422 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-08 09:01:08,422 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-08 09:01:08,423 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-08 09:01:08,423 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-08 09:01:08,424 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-08 09:01:08,424 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-08 09:01:08,425 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-08 09:01:08,426 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-08 09:01:08,426 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-08 09:01:08,427 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-08 09:01:08,428 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-08 09:01:08,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret3 := main(); {1442#true} is VALID [2022-04-08 09:01:08,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #47#return; {1442#true} is VALID [2022-04-08 09:01:08,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-08 09:01:08,429 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-08 09:01:08,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1442#true} is VALID [2022-04-08 09:01:08,429 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-08 09:01:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103639878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:08,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:08,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-08 09:01:08,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:08,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875534381] [2022-04-08 09:01:08,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875534381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:08,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:08,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:01:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335382353] [2022-04-08 09:01:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:08,430 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-08 09:01:08,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:08,431 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-08 09:01:08,443 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-08 09:01:08,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:01:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:01:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:01:08,444 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-08 09:01:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:08,724 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 09:01:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:01:08,724 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-08 09:01:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:08,724 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-08 09:01:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-08 09:01:08,725 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-08 09:01:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-08 09:01:08,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-08 09:01:08,748 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-08 09:01:08,749 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:01:08,749 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:01:08,750 INFO L912 BasicCegarLoop]: 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-08 09:01:08,750 INFO L913 BasicCegarLoop]: 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-08 09:01:08,750 INFO L914 BasicCegarLoop]: 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-08 09:01:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:01:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 09:01:08,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:08,782 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-08 09:01:08,783 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-08 09:01:08,784 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-08 09:01:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:08,786 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:01:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:01:08,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:08,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:08,786 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-08 09:01:08,786 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-08 09:01:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:08,787 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:01:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:01:08,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:08,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:08,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:08,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:08,788 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-08 09:01:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 09:01:08,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-08 09:01:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:08,791 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 09:01:08,792 INFO L479 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-08 09:01:08,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 09:01:08,818 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-08 09:01:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:01:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:01:08,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:08,819 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:08,840 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-08 09:01:09,031 WARN L460 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-08 09:01:09,032 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 5 times [2022-04-08 09:01:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110112810] [2022-04-08 09:01:09,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:09,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 6 times [2022-04-08 09:01:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:09,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184728017] [2022-04-08 09:01:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:09,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:01:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:01:09,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:01:09,072 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:01:09,072 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:01:09,073 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:01:09,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 09:01:09,082 INFO L719 BasicCegarLoop]: Path program histogram: [6, 6, 2, 2, 2] [2022-04-08 09:01:09,084 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:09,093 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:01:09,094 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:01:09,094 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-08 09:01:09,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:01:09 BoogieIcfgContainer [2022-04-08 09:01:09,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:01:09,096 INFO L158 Benchmark]: Toolchain (without parser) took 7356.27ms. Allocated memory was 182.5MB in the beginning and 278.9MB in the end (delta: 96.5MB). Free memory was 126.2MB in the beginning and 149.3MB in the end (delta: -23.1MB). Peak memory consumption was 73.2MB. Max. memory is 8.0GB. [2022-04-08 09:01:09,096 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:01:09,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.82ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 126.1MB in the beginning and 201.7MB in the end (delta: -75.7MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-08 09:01:09,096 INFO L158 Benchmark]: Boogie Preprocessor took 42.65ms. Allocated memory is still 231.7MB. Free memory was 201.7MB in the beginning and 200.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:01:09,096 INFO L158 Benchmark]: RCFGBuilder took 240.94ms. Allocated memory is still 231.7MB. Free memory was 200.2MB in the beginning and 189.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:01:09,097 INFO L158 Benchmark]: TraceAbstraction took 6825.82ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 189.2MB in the beginning and 149.3MB in the end (delta: 39.9MB). Peak memory consumption was 86.5MB. Max. memory is 8.0GB. [2022-04-08 09:01:09,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.82ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 126.1MB in the beginning and 201.7MB in the end (delta: -75.7MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.65ms. Allocated memory is still 231.7MB. Free memory was 201.7MB in the beginning and 200.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 240.94ms. Allocated memory is still 231.7MB. Free memory was 200.2MB in the beginning and 189.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6825.82ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 189.2MB in the beginning and 149.3MB in the end (delta: 39.9MB). Peak memory consumption was 86.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.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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.1s 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-08 09:01:09,133 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...