/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:07:28,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:07:28,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:07:28,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:07:28,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:07:28,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:07:28,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:07:28,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:07:28,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:07:28,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:07:28,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:07:28,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:07:28,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:07:28,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:07:28,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:07:28,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:07:28,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:07:28,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:07:28,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:07:28,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:07:28,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:07:28,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:07:28,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:07:28,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:07:28,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:07:28,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:07:28,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:07:28,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:07:28,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:07:28,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:07:28,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:07:28,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:07:28,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:07:28,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:07:28,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:07:28,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:07:28,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:07:28,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:07:28,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:07:28,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:07:28,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:07:28,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:07:28,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:07:28,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:07:28,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:07:28,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:07:28,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:07:28,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:07:28,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:28,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:07:28,535 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:07:28,536 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:07:28,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:07:28,536 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:07:28,536 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:07:28,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:07:28,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:07:28,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:07:28,718 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:07:28,719 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:07:28,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2022-04-15 07:07:28,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5247c7c4/dcadd198478a4b99ad703643b3065759/FLAGde6fa4c4d [2022-04-15 07:07:29,087 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:07:29,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2022-04-15 07:07:29,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5247c7c4/dcadd198478a4b99ad703643b3065759/FLAGde6fa4c4d [2022-04-15 07:07:29,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5247c7c4/dcadd198478a4b99ad703643b3065759 [2022-04-15 07:07:29,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:07:29,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:07:29,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:29,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:07:29,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:07:29,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c06236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29, skipping insertion in model container [2022-04-15 07:07:29,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:07:29,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:07:29,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[557,570] [2022-04-15 07:07:29,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[613,626] [2022-04-15 07:07:29,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:29,695 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:07:29,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[557,570] [2022-04-15 07:07:29,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[613,626] [2022-04-15 07:07:29,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:29,716 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:07:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29 WrapperNode [2022-04-15 07:07:29,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:29,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:07:29,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:07:29,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:07:29,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:07:29,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:07:29,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:07:29,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:07:29,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (1/1) ... [2022-04-15 07:07:29,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:29,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:29,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:07:29,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:07:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:07:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:07:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:07:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:07:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:07:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:07:29,838 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:07:29,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:07:29,967 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:07:29,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:07:29,972 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:07:29,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:29 BoogieIcfgContainer [2022-04-15 07:07:29,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:07:29,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:07:29,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:07:29,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:07:29,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:07:29" (1/3) ... [2022-04-15 07:07:29,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae5ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:29, skipping insertion in model container [2022-04-15 07:07:29,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:29" (2/3) ... [2022-04-15 07:07:29,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae5ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:29, skipping insertion in model container [2022-04-15 07:07:29,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:29" (3/3) ... [2022-04-15 07:07:29,977 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-b.c [2022-04-15 07:07:29,980 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:07:29,980 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-15 07:07:30,018 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:07:30,022 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:07:30,022 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-15 07:07:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:07:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 07:07:30,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:30,060 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:30,061 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-15 07:07:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:30,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790409041] [2022-04-15 07:07:30,083 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 2 times [2022-04-15 07:07:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134006624] [2022-04-15 07:07:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:30,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 07:07:30,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 07:07:30,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-15 07:07:30,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:30,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(26, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 07:07:30,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 07:07:30,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-15 07:07:30,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-15 07:07:30,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-15 07:07:30,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} is VALID [2022-04-15 07:07:30,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {22#false} is VALID [2022-04-15 07:07:30,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 256 < ~v~0 % 256; {22#false} is VALID [2022-04-15 07:07:30,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 07:07:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:30,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134006624] [2022-04-15 07:07:30,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134006624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:30,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:30,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:30,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790409041] [2022-04-15 07:07:30,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790409041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:30,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:30,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242272817] [2022-04-15 07:07:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 07:07:30,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:30,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:30,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:07:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:30,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:07:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:07:30,287 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:30,374 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-04-15 07:07:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:07:30,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 07:07:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 07:07:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 07:07:30,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-15 07:07:30,425 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-15 07:07:30,430 INFO L225 Difference]: With dead ends: 27 [2022-04-15 07:07:30,430 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 07:07:30,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-15 07:07:30,442 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:30,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 07:07:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 07:07:30,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:30,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,462 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,462 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:30,464 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 07:07:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 07:07:30,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:30,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:30,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 07:07:30,465 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 07:07:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:30,466 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 07:07:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 07:07:30,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:30,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:30,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:30,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 07:07:30,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-04-15 07:07:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:30,468 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 07:07:30,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:30,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 07:07:30,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 07:07:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 07:07:30,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:30,480 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:30,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:07:30,481 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-15 07:07:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944328018] [2022-04-15 07:07:30,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:07:30,494 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:07:30,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:07:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 2 times [2022-04-15 07:07:30,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:30,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031577039] [2022-04-15 07:07:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:30,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(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(26, 2);call #Ultimate.allocInit(12, 3); {134#true} is VALID [2022-04-15 07:07:30,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 07:07:30,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 07:07:30,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:30,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(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(26, 2);call #Ultimate.allocInit(12, 3); {134#true} is VALID [2022-04-15 07:07:30,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 07:07:30,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 07:07:30,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret7 := main(); {134#true} is VALID [2022-04-15 07:07:30,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {134#true} is VALID [2022-04-15 07:07:30,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {139#(= main_~s~0 0)} is VALID [2022-04-15 07:07:30,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 % 256 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 07:07:30,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 07:07:30,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} assume ~s~0 % 256 < ~v~0 % 256; {135#false} is VALID [2022-04-15 07:07:30,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 07:07:30,584 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-15 07:07:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:30,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031577039] [2022-04-15 07:07:30,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031577039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:07:30,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494284058] [2022-04-15 07:07:30,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:07:30,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:07:30,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:30,587 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-15 07:07:30,607 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-15 07:07:30,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:07:30,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:07:30,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:07:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:30,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:07:30,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2022-04-15 07:07:30,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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(26, 2);call #Ultimate.allocInit(12, 3); {134#true} is VALID [2022-04-15 07:07:30,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 07:07:30,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 07:07:30,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret7 := main(); {134#true} is VALID [2022-04-15 07:07:30,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {134#true} is VALID [2022-04-15 07:07:30,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {139#(= main_~s~0 0)} is VALID [2022-04-15 07:07:30,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(= main_~s~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 % 256 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {166#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-15 07:07:30,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(= main_~s~0 (mod main_~v~0 256))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {166#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-15 07:07:30,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(= main_~s~0 (mod main_~v~0 256))} assume ~s~0 % 256 < ~v~0 % 256; {135#false} is VALID [2022-04-15 07:07:30,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 07:07:30,719 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-15 07:07:30,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:07:31,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#false} assume !false; {135#false} is VALID [2022-04-15 07:07:31,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} assume ~s~0 % 256 < ~v~0 % 256; {135#false} is VALID [2022-04-15 07:07:31,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 07:07:31,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= (div (+ (- 256) (* (mod main_~s~0 256) (- 1))) (- 256)) (+ (div (mod main_~s~0 256) 256) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296);~v~0 := #t~nondet5;havoc #t~nondet5;~s~0 := ~s~0 % 256 + ~v~0 % 256;#t~pre6 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre6; {140#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 07:07:31,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {185#(<= (div (+ (- 256) (* (mod main_~s~0 256) (- 1))) (- 256)) (+ (div (mod main_~s~0 256) 256) 1))} is VALID [2022-04-15 07:07:31,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {134#true} is VALID [2022-04-15 07:07:31,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret7 := main(); {134#true} is VALID [2022-04-15 07:07:31,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #38#return; {134#true} is VALID [2022-04-15 07:07:31,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2022-04-15 07:07:31,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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(26, 2);call #Ultimate.allocInit(12, 3); {134#true} is VALID [2022-04-15 07:07:31,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {134#true} is VALID [2022-04-15 07:07:31,375 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-15 07:07:31,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494284058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:07:31,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:07:31,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 07:07:31,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944328018] [2022-04-15 07:07:31,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944328018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:31,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:31,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:07:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892714516] [2022-04-15 07:07:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:31,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:07:31,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:31,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,390 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-15 07:07:31,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:07:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:07:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:07:31,393 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:31,468 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 07:07:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:07:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:07:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 07:07:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 07:07:31,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-15 07:07:31,484 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-15 07:07:31,485 INFO L225 Difference]: With dead ends: 16 [2022-04-15 07:07:31,485 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 07:07:31,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:07:31,487 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:31,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 07:07:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 07:07:31,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:31,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,492 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,493 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:31,494 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 07:07:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 07:07:31,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:31,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:31,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 07:07:31,494 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 07:07:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:31,495 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 07:07:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 07:07:31,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:31,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:31,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:31,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 07:07:31,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 07:07:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:31,497 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 07:07:31,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:31,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 07:07:31,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 07:07:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:07:31,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:31,510 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:31,537 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-15 07:07:31,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:07:31,733 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:31,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 3 times [2022-04-15 07:07:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473037514] [2022-04-15 07:07:31,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:07:31,737 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:07:31,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:07:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 4 times [2022-04-15 07:07:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829144034] [2022-04-15 07:07:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 07:07:31,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 07:07:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 07:07:31,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 07:07:31,785 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 07:07:31,785 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 07:07:31,787 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-04-15 07:07:31,788 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-04-15 07:07:31,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:07:31,792 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-15 07:07:31,794 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 07:07:31,800 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 07:07:31,801 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 07:07:31,801 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-15 07:07:31,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:07:31 BoogieIcfgContainer [2022-04-15 07:07:31,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:07:31,803 INFO L158 Benchmark]: Toolchain (without parser) took 2245.15ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 126.8MB in the beginning and 117.1MB in the end (delta: 9.7MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-04-15 07:07:31,803 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:07:31,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.72ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 152.1MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:07:31,803 INFO L158 Benchmark]: Boogie Preprocessor took 22.87ms. Allocated memory is still 176.2MB. Free memory was 152.1MB in the beginning and 150.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:07:31,804 INFO L158 Benchmark]: RCFGBuilder took 231.66ms. Allocated memory is still 176.2MB. Free memory was 150.7MB in the beginning and 140.4MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:07:31,804 INFO L158 Benchmark]: TraceAbstraction took 1828.38ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 139.9MB in the beginning and 117.1MB in the end (delta: 22.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-04-15 07:07:31,805 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 157.72ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 152.1MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.87ms. Allocated memory is still 176.2MB. Free memory was 152.1MB in the beginning and 150.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 231.66ms. Allocated memory is still 176.2MB. Free memory was 150.7MB in the beginning and 140.4MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1828.38ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 139.9MB in the beginning and 117.1MB in the end (delta: 22.8MB). Peak memory consumption was 60.8MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5] unsigned char n = __VERIFIER_nondet_uchar(); [L6] COND FALSE !(n == 0) [L9] unsigned char v = 0; [L10] unsigned char s = 0; [L11] unsigned int i = 0; [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i [L12] COND FALSE !(i < n) [L17] COND TRUE s < v [L18] reach_error() - UnprovableResult [Line: 22]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 26 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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-15 07:07:31,819 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...