/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:40:33,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:40:33,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:40:33,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:40:33,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:40:33,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:40:33,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:40:33,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:40:33,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:40:33,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:40:33,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:40:33,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:40:33,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:40:33,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:40:33,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:40:33,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:40:33,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:40:33,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:40:33,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:40:33,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:40:33,824 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:40:33,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:40:33,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:40:33,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:40:33,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:40:33,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:40:33,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:40:33,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:40:33,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:40:33,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:40:33,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:40:33,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:40:33,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:40:33,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:40:33,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:40:33,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:40:33,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:40:33,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:40:33,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:40:33,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:40:33,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:40:33,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:40:33,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:40:33,861 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:40:33,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:40:33,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:40:33,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:40:33,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:40:33,864 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:40:33,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:40:33,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:40:33,865 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:40:33,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:40:33,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:40:33,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:40:33,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:40:33,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:40:33,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:40:33,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:40:33,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:40:33,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:40:33,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:40:33,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:40:34,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:40:34,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:40:34,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:40:34,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:40:34,048 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:40:34,049 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-27 11:40:34,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf5dbbe/23d183b816b34cb0a1ae2a576da65cd5/FLAGeb87e8df0 [2022-04-27 11:40:34,468 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:40:34,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2022-04-27 11:40:34,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf5dbbe/23d183b816b34cb0a1ae2a576da65cd5/FLAGeb87e8df0 [2022-04-27 11:40:34,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf5dbbe/23d183b816b34cb0a1ae2a576da65cd5 [2022-04-27 11:40:34,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:40:34,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:40:34,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:40:34,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:40:34,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:40:34,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4357d7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34, skipping insertion in model container [2022-04-27 11:40:34,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:40:34,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:40:34,619 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-27 11:40:34,621 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-27 11:40:34,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:40:34,627 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:40:34,636 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-27 11:40:34,637 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-27 11:40:34,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:40:34,645 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:40:34,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34 WrapperNode [2022-04-27 11:40:34,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:40:34,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:40:34,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:40:34,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:40:34,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:40:34,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:40:34,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:40:34,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:40:34,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (1/1) ... [2022-04-27 11:40:34,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:40:34,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:40:34,684 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-27 11:40:34,686 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-27 11:40:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:40:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:40:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:40:34,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:40:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:40:34,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:40:34,750 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:40:34,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:40:34,837 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:40:34,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:40:34,842 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:40:34,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:40:34 BoogieIcfgContainer [2022-04-27 11:40:34,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:40:34,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:40:34,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:40:34,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:40:34,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:40:34" (1/3) ... [2022-04-27 11:40:34,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58845c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:40:34, skipping insertion in model container [2022-04-27 11:40:34,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:34" (2/3) ... [2022-04-27 11:40:34,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58845c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:40:34, skipping insertion in model container [2022-04-27 11:40:34,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:40:34" (3/3) ... [2022-04-27 11:40:34,848 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-b.c [2022-04-27 11:40:34,857 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:40:34,857 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-27 11:40:34,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:40:34,914 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56cd46ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e296b55 [2022-04-27 11:40:34,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-27 11:40:34,931 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-27 11:40:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-27 11:40:34,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:34,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:34,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:34,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254505, now seen corresponding path program 1 times [2022-04-27 11:40:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750509389] [2022-04-27 11:40:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,193 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-27 11:40:35,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:40:35,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-27 11:40:35,196 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-27 11:40:35,196 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-27 11:40:35,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 11:40:35,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2022-04-27 11:40:35,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-27 11:40:35,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {21#true} is VALID [2022-04-27 11:40:35,198 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-27 11:40:35,200 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-27 11:40:35,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~s~0 % 256 < ~v~0 % 256; {22#false} is VALID [2022-04-27 11:40:35,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 11:40:35,201 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-27 11:40:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:35,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750509389] [2022-04-27 11:40:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750509389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:40:35,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:40:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:40:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028507990] [2022-04-27 11:40:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:40:35,208 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-27 11:40:35,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:35,211 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-27 11:40:35,224 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-27 11:40:35,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:40:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:35,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:40:35,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:40:35,252 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-27 11:40:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:35,360 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-04-27 11:40:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:40:35,361 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-27 11:40:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:35,362 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-27 11:40:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 11:40:35,372 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-27 11:40:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 11:40:35,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-27 11:40:35,424 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-27 11:40:35,429 INFO L225 Difference]: With dead ends: 27 [2022-04-27 11:40:35,429 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 11:40:35,432 INFO L412 NwaCegarLoop]: 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-27 11:40:35,435 INFO L413 NwaCegarLoop]: 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-27 11:40:35,436 INFO L414 NwaCegarLoop]: 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-27 11:40:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 11:40:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 11:40:35,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:35,460 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-27 11:40:35,460 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-27 11:40:35,461 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-27 11:40:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:35,464 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 11:40:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 11:40:35,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:35,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:35,465 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-27 11:40:35,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-27 11:40:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:35,467 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 11:40:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 11:40:35,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:35,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:35,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:35,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:35,468 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-27 11:40:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 11:40:35,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-04-27 11:40:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:35,471 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 11:40:35,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-27 11:40:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 11:40:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:40:35,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:35,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:40:35,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1187666007, now seen corresponding path program 1 times [2022-04-27 11:40:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:35,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15752894] [2022-04-27 11:40:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#(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); {107#true} is VALID [2022-04-27 11:40:35,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume true; {107#true} is VALID [2022-04-27 11:40:35,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} #38#return; {107#true} is VALID [2022-04-27 11:40:35,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:40:35,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(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); {107#true} is VALID [2022-04-27 11:40:35,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2022-04-27 11:40:35,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #38#return; {107#true} is VALID [2022-04-27 11:40:35,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret7 := main(); {107#true} is VALID [2022-04-27 11:40:35,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {107#true} is VALID [2022-04-27 11:40:35,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {112#(= main_~s~0 0)} is VALID [2022-04-27 11:40:35,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(= 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; {113#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-27 11:40:35,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#(<= (+ (* 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); {113#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-27 11:40:35,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ (* 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; {108#false} is VALID [2022-04-27 11:40:35,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-04-27 11:40:35,602 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-27 11:40:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:35,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15752894] [2022-04-27 11:40:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15752894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:40:35,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568041831] [2022-04-27 11:40:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:40:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:40:35,605 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-27 11:40:35,637 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-27 11:40:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:40:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:35,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:40:35,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2022-04-27 11:40:35,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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); {107#true} is VALID [2022-04-27 11:40:35,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2022-04-27 11:40:35,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #38#return; {107#true} is VALID [2022-04-27 11:40:35,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret7 := main(); {107#true} is VALID [2022-04-27 11:40:35,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {107#true} is VALID [2022-04-27 11:40:35,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {112#(= main_~s~0 0)} is VALID [2022-04-27 11:40:35,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(= 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; {139#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-27 11:40:35,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#(= main_~s~0 (mod main_~v~0 256))} assume !(~i~0 % 4294967296 < ~n~0 % 256 % 4294967296); {139#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-27 11:40:35,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#(= main_~s~0 (mod main_~v~0 256))} assume ~s~0 % 256 < ~v~0 % 256; {108#false} is VALID [2022-04-27 11:40:35,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-04-27 11:40:35,737 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-27 11:40:35,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:40:36,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-04-27 11:40:36,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ (* 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; {108#false} is VALID [2022-04-27 11:40:36,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#(<= (+ (* 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); {113#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-27 11:40:36,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(<= (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; {113#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-27 11:40:36,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} assume !(0 == ~n~0 % 256);~v~0 := 0;~s~0 := 0;~i~0 := 0; {158#(<= (div (+ (- 256) (* (mod main_~s~0 256) (- 1))) (- 256)) (+ (div (mod main_~s~0 256) 256) 1))} is VALID [2022-04-27 11:40:36,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} ~n~0 := #t~nondet4;havoc #t~nondet4; {107#true} is VALID [2022-04-27 11:40:36,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret7 := main(); {107#true} is VALID [2022-04-27 11:40:36,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #38#return; {107#true} is VALID [2022-04-27 11:40:36,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2022-04-27 11:40:36,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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); {107#true} is VALID [2022-04-27 11:40:36,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2022-04-27 11:40:36,392 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-27 11:40:36,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568041831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:40:36,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:40:36,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-27 11:40:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694081406] [2022-04-27 11:40:36,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:40:36,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:36,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:36,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:40:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:40:36,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:40:36,411 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:36,489 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 11:40:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:40:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-27 11:40:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-27 11:40:36,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-27 11:40:36,506 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-27 11:40:36,509 INFO L225 Difference]: With dead ends: 16 [2022-04-27 11:40:36,509 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 11:40:36,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:40:36,511 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:40:36,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:40:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 11:40:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 11:40:36,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:36,516 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-27 11:40:36,517 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-27 11:40:36,517 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-27 11:40:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:36,519 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 11:40:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:36,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:36,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:36,519 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-27 11:40:36,520 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-27 11:40:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:36,521 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 11:40:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:36,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:36,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:36,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:36,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:36,522 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-27 11:40:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 11:40:36,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 11:40:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:36,523 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 11:40:36,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 2 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-27 11:40:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:40:36,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:36,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:36,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:40:36,735 WARN L477 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-27 11:40:36,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1837111337, now seen corresponding path program 2 times [2022-04-27 11:40:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:36,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378110285] [2022-04-27 11:40:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 11:40:36,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 11:40:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 11:40:36,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 11:40:36,789 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 11:40:36,790 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-04-27 11:40:36,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-04-27 11:40:36,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:40:36,794 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 11:40:36,796 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 11:40:36,808 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:40:36,809 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:40:36,810 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:40:36,810 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:40:36,810 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-27 11:40:36,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:40:36 BoogieIcfgContainer [2022-04-27 11:40:36,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:40:36,811 INFO L158 Benchmark]: Toolchain (without parser) took 2325.40ms. Allocated memory was 205.5MB in the beginning and 271.6MB in the end (delta: 66.1MB). Free memory was 153.7MB in the beginning and 191.5MB in the end (delta: -37.8MB). Peak memory consumption was 29.7MB. Max. memory is 8.0GB. [2022-04-27 11:40:36,811 INFO L158 Benchmark]: CDTParser took 1.81ms. Allocated memory is still 205.5MB. Free memory was 169.9MB in the beginning and 169.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:40:36,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 205.5MB. Free memory was 153.4MB in the beginning and 180.9MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:40:36,812 INFO L158 Benchmark]: Boogie Preprocessor took 17.47ms. Allocated memory is still 205.5MB. Free memory was 180.9MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:40:36,812 INFO L158 Benchmark]: RCFGBuilder took 178.61ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 169.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 11:40:36,813 INFO L158 Benchmark]: TraceAbstraction took 1966.41ms. Allocated memory was 205.5MB in the beginning and 271.6MB in the end (delta: 66.1MB). Free memory was 168.9MB in the beginning and 191.5MB in the end (delta: -22.6MB). Peak memory consumption was 44.4MB. Max. memory is 8.0GB. [2022-04-27 11:40:36,814 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 1.81ms. Allocated memory is still 205.5MB. Free memory was 169.9MB in the beginning and 169.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 158.19ms. Allocated memory is still 205.5MB. Free memory was 153.4MB in the beginning and 180.9MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.47ms. Allocated memory is still 205.5MB. Free memory was 180.9MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 178.61ms. Allocated memory is still 205.5MB. Free memory was 179.4MB in the beginning and 169.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1966.41ms. Allocated memory was 205.5MB in the beginning and 271.6MB in the end (delta: 66.1MB). Free memory was 168.9MB in the beginning and 191.5MB in the end (delta: -22.6MB). Peak memory consumption was 44.4MB. 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; VAL [i=0, n=2, s=0, v=0] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=1, n=2, s=255, v=255] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=2, n=2, s=0, v=1] [L12] COND FALSE !(i < n) VAL [i=2, n=2, s=0, v=1] [L17] COND TRUE s < v VAL [i=2, n=2, s=0, v=1] [L18] reach_error() VAL [i=2, n=2, s=0, v=1] - 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.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 26 mSDtfsCounter, 30 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: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 2 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, 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-27 11:40:36,829 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...