/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-zilu/benchmark10_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:43:58,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:43:58,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:43:58,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:43:58,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:43:58,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:43:58,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:43:58,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:43:58,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:43:58,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:43:58,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:43:58,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:43:58,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:43:58,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:43:58,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:43:58,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:43:58,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:43:58,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:43:58,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:43:58,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:43:58,339 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:43:58,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:43:58,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:43:58,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:43:58,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:43:58,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:43:58,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:43:58,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:43:58,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:43:58,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:43:58,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:43:58,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:43:58,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:43:58,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:43:58,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:43:58,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:43:58,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:43:58,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:43:58,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:43:58,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:43:58,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:43:58,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:43:58,350 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:43:58,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:43:58,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:43:58,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:43:58,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:43:58,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:43:58,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:43:58,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:43:58,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:43:58,372 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:43:58,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:43:58,372 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:43:58,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:43:58,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:43:58,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:43:58,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:43:58,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:43:58,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:43:58,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:43:58,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:43:58,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:43:58,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:43:58,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:43:58,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:43:58,375 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:43:58,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:43:58,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:43:58,375 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:43:58,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:43:58,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:43:58,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:43:58,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:43:58,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:43:58,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-27 11:43:58,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7984616/a9c0830d323b4bcbbece743745d93b34/FLAGab65eb6e7 [2022-04-27 11:43:58,925 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:43:58,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-27 11:43:58,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7984616/a9c0830d323b4bcbbece743745d93b34/FLAGab65eb6e7 [2022-04-27 11:43:59,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7984616/a9c0830d323b4bcbbece743745d93b34 [2022-04-27 11:43:59,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:43:59,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:43:59,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:43:59,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:43:59,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:43:59,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1792071b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59, skipping insertion in model container [2022-04-27 11:43:59,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:43:59,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:43:59,496 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-zilu/benchmark10_conjunctive.i[873,886] [2022-04-27 11:43:59,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:43:59,530 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:43:59,539 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-zilu/benchmark10_conjunctive.i[873,886] [2022-04-27 11:43:59,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:43:59,555 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:43:59,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59 WrapperNode [2022-04-27 11:43:59,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:43:59,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:43:59,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:43:59,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:43:59,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:43:59,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:43:59,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:43:59,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:43:59,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (1/1) ... [2022-04-27 11:43:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:43:59,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:43:59,605 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:43:59,610 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:43:59,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:43:59,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:43:59,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:43:59,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:43:59,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:43:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:43:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:43:59,681 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:43:59,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:43:59,812 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:43:59,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:43:59,817 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:43:59,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:59 BoogieIcfgContainer [2022-04-27 11:43:59,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:43:59,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:43:59,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:43:59,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:43:59,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:43:59" (1/3) ... [2022-04-27 11:43:59,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342c17df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:59, skipping insertion in model container [2022-04-27 11:43:59,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:43:59" (2/3) ... [2022-04-27 11:43:59,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342c17df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:43:59, skipping insertion in model container [2022-04-27 11:43:59,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:43:59" (3/3) ... [2022-04-27 11:43:59,830 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2022-04-27 11:43:59,840 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:43:59,840 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:43:59,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:43:59,877 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@69dd1d37, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3afc57ca [2022-04-27 11:43:59,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:43:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:43:59,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:43:59,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:43:59,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:43:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:43:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 1 times [2022-04-27 11:43:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:43:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353177329] [2022-04-27 11:43:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:43:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:43:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {24#true} is VALID [2022-04-27 11:44:00,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:44:00,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:44:00,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:00,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {24#true} is VALID [2022-04-27 11:44:00,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:44:00,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-27 11:44:00,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-27 11:44:00,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-27 11:44:00,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 == ~c~0 && 0 == ~i~0); {29#(<= main_~i~0 0)} is VALID [2022-04-27 11:44:00,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= main_~i~0 0)} assume !(~i~0 < 100); {25#false} is VALID [2022-04-27 11:44:00,094 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {25#false} is VALID [2022-04-27 11:44:00,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 11:44:00,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:44:00,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:44:00,095 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:44:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353177329] [2022-04-27 11:44:00,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353177329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:00,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:00,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:44:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263164914] [2022-04-27 11:44:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:44:00,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:00,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,126 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-27 11:44:00,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:44:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:44:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:44:00,146 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,296 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 11:44:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:44:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:44:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-27 11:44:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-27 11:44:00,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-04-27 11:44:00,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:00,361 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:44:00,362 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:44:00,364 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:44:00,369 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:00,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:44:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 11:44:00,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:00,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,389 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,390 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,391 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 11:44:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:44:00,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:00,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:00,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:44:00,392 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:44:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,393 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 11:44:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:44:00,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:00,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:00,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:00,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 11:44:00,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 11:44:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:00,397 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 11:44:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 11:44:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:44:00,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:00,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:00,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 1 times [2022-04-27 11:44:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:00,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069511012] [2022-04-27 11:44:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(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); {139#true} is VALID [2022-04-27 11:44:00,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 11:44:00,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #50#return; {139#true} is VALID [2022-04-27 11:44:00,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:00,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(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); {139#true} is VALID [2022-04-27 11:44:00,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 11:44:00,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #50#return; {139#true} is VALID [2022-04-27 11:44:00,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret3 := main(); {139#true} is VALID [2022-04-27 11:44:00,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {139#true} is VALID [2022-04-27 11:44:00,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#true} assume !!(0 == ~c~0 && 0 == ~i~0); {144#(<= 0 main_~i~0)} is VALID [2022-04-27 11:44:00,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {144#(<= 0 main_~i~0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {145#(<= 1 main_~i~0)} is VALID [2022-04-27 11:44:00,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {145#(<= 1 main_~i~0)} assume ~i~0 <= 0; {140#false} is VALID [2022-04-27 11:44:00,451 INFO L272 TraceCheckUtils]: 9: Hoare triple {140#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {140#false} is VALID [2022-04-27 11:44:00,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 11:44:00,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 11:44:00,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 11:44:00,452 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:44:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069511012] [2022-04-27 11:44:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069511012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:00,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:00,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:44:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592530080] [2022-04-27 11:44:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:00,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:00,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,462 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-27 11:44:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:44:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:44:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:44:00,463 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,546 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 11:44:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:44:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 11:44:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 11:44:00,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-27 11:44:00,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:00,570 INFO L225 Difference]: With dead ends: 20 [2022-04-27 11:44:00,570 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:44:00,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:44:00,571 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:00,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:44:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:44:00,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:00,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,577 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,577 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,578 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:44:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:00,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:00,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:00,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:44:00,578 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:44:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,579 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:44:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:00,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:00,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:00,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:00,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 11:44:00,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 11:44:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:00,581 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 11:44:00,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:44:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:44:00,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:00,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:00,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:44:00,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 1 times [2022-04-27 11:44:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:00,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767137850] [2022-04-27 11:44:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#(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); {236#true} is VALID [2022-04-27 11:44:00,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-27 11:44:00,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #50#return; {236#true} is VALID [2022-04-27 11:44:00,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:00,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(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); {236#true} is VALID [2022-04-27 11:44:00,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-27 11:44:00,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #50#return; {236#true} is VALID [2022-04-27 11:44:00,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret3 := main(); {236#true} is VALID [2022-04-27 11:44:00,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {236#true} is VALID [2022-04-27 11:44:00,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(0 == ~c~0 && 0 == ~i~0); {241#(<= main_~i~0 0)} is VALID [2022-04-27 11:44:00,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(<= main_~i~0 0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {242#(<= main_~i~0 1)} is VALID [2022-04-27 11:44:00,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#(<= main_~i~0 1)} assume !(~i~0 <= 0); {242#(<= main_~i~0 1)} is VALID [2022-04-27 11:44:00,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(<= main_~i~0 1)} assume !(~i~0 < 100); {237#false} is VALID [2022-04-27 11:44:00,631 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {237#false} is VALID [2022-04-27 11:44:00,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-27 11:44:00,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-27 11:44:00,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-27 11:44:00,631 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:44:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:00,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767137850] [2022-04-27 11:44:00,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767137850] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:00,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471202208] [2022-04-27 11:44:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:00,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:00,634 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:44:00,634 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:44:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:44:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:00,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:00,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-27 11:44:00,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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); {236#true} is VALID [2022-04-27 11:44:00,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-27 11:44:00,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #50#return; {236#true} is VALID [2022-04-27 11:44:00,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret3 := main(); {236#true} is VALID [2022-04-27 11:44:00,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {236#true} is VALID [2022-04-27 11:44:00,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(0 == ~c~0 && 0 == ~i~0); {241#(<= main_~i~0 0)} is VALID [2022-04-27 11:44:00,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(<= main_~i~0 0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {242#(<= main_~i~0 1)} is VALID [2022-04-27 11:44:00,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#(<= main_~i~0 1)} assume !(~i~0 <= 0); {242#(<= main_~i~0 1)} is VALID [2022-04-27 11:44:00,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(<= main_~i~0 1)} assume !(~i~0 < 100); {237#false} is VALID [2022-04-27 11:44:00,760 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {237#false} is VALID [2022-04-27 11:44:00,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-27 11:44:00,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-27 11:44:00,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-27 11:44:00,760 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:44:00,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:00,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-27 11:44:00,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-27 11:44:00,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-27 11:44:00,830 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {237#false} is VALID [2022-04-27 11:44:00,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(< main_~i~0 100)} assume !(~i~0 < 100); {237#false} is VALID [2022-04-27 11:44:00,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(< main_~i~0 100)} assume !(~i~0 <= 0); {298#(< main_~i~0 100)} is VALID [2022-04-27 11:44:00,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#(< main_~i~0 99)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {298#(< main_~i~0 100)} is VALID [2022-04-27 11:44:00,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(0 == ~c~0 && 0 == ~i~0); {305#(< main_~i~0 99)} is VALID [2022-04-27 11:44:00,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {236#true} is VALID [2022-04-27 11:44:00,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret3 := main(); {236#true} is VALID [2022-04-27 11:44:00,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #50#return; {236#true} is VALID [2022-04-27 11:44:00,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-27 11:44:00,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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); {236#true} is VALID [2022-04-27 11:44:00,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-27 11:44:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471202208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:00,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-27 11:44:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533243778] [2022-04-27 11:44:00,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:44:00,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:00,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:00,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:44:00,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:00,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:44:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:44:00,848 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:00,923 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 11:44:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:44:00,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:44:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 11:44:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 11:44:00,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-27 11:44:00,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:00,985 INFO L225 Difference]: With dead ends: 26 [2022-04-27 11:44:00,985 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 11:44:00,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:44:00,986 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:00,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 11:44:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 11:44:00,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:00,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:00,999 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:01,000 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:01,001 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 11:44:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 11:44:01,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:01,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:01,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:44:01,001 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:44:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:01,002 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 11:44:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 11:44:01,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:01,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:01,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:01,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 11:44:01,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-27 11:44:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:01,004 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 11:44:01,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 11:44:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:44:01,005 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:01,005 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:01,022 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-27 11:44:01,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:01,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 824218463, now seen corresponding path program 2 times [2022-04-27 11:44:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:01,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690199545] [2022-04-27 11:44:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:01,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(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); {450#true} is VALID [2022-04-27 11:44:01,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-27 11:44:01,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #50#return; {450#true} is VALID [2022-04-27 11:44:01,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:01,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(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); {450#true} is VALID [2022-04-27 11:44:01,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-27 11:44:01,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #50#return; {450#true} is VALID [2022-04-27 11:44:01,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret3 := main(); {450#true} is VALID [2022-04-27 11:44:01,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {450#true} is VALID [2022-04-27 11:44:01,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#true} assume !!(0 == ~c~0 && 0 == ~i~0); {455#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:01,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= 0 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {456#(<= 0 main_~c~0)} is VALID [2022-04-27 11:44:01,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {457#(<= 1 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:01,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(<= 1 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {458#(<= 1 main_~c~0)} is VALID [2022-04-27 11:44:01,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~c~0)} assume !(~i~0 <= 0); {459#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} is VALID [2022-04-27 11:44:01,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {460#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:01,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 4 (+ main_~i~0 main_~c~0))} assume !(~i~0 <= 0); {460#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:01,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#(<= 4 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {461#(<= 4 main_~c~0)} is VALID [2022-04-27 11:44:01,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#(<= 4 main_~c~0)} assume !(~i~0 <= 0); {461#(<= 4 main_~c~0)} is VALID [2022-04-27 11:44:01,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#(<= 4 main_~c~0)} assume !(~i~0 < 100); {461#(<= 4 main_~c~0)} is VALID [2022-04-27 11:44:01,387 INFO L272 TraceCheckUtils]: 16: Hoare triple {461#(<= 4 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {462#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:01,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {462#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {463#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:01,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {463#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {451#false} is VALID [2022-04-27 11:44:01,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-04-27 11:44:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:01,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690199545] [2022-04-27 11:44:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690199545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:01,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889904641] [2022-04-27 11:44:01,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:44:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:01,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:44:01,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:44:01,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:44:01,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:44:01,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:44:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:01,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:01,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2022-04-27 11:44:01,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#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); {450#true} is VALID [2022-04-27 11:44:01,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-27 11:44:01,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #50#return; {450#true} is VALID [2022-04-27 11:44:01,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret3 := main(); {450#true} is VALID [2022-04-27 11:44:01,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {450#true} is VALID [2022-04-27 11:44:01,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#true} assume !!(0 == ~c~0 && 0 == ~i~0); {486#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} is VALID [2022-04-27 11:44:01,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {456#(<= 0 main_~c~0)} is VALID [2022-04-27 11:44:01,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {493#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} is VALID [2022-04-27 11:44:01,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {497#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-27 11:44:01,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#(and (< 0 main_~c~0) (< 1 main_~i~0))} assume !(~i~0 <= 0); {497#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-27 11:44:01,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(and (< 0 main_~c~0) (< 1 main_~i~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {504#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-27 11:44:01,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {504#(and (< 2 main_~i~0) (< 2 main_~c~0))} assume !(~i~0 <= 0); {504#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-27 11:44:01,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {504#(and (< 2 main_~i~0) (< 2 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {511#(< 5 main_~c~0)} is VALID [2022-04-27 11:44:01,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(< 5 main_~c~0)} assume !(~i~0 <= 0); {511#(< 5 main_~c~0)} is VALID [2022-04-27 11:44:01,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(< 5 main_~c~0)} assume !(~i~0 < 100); {511#(< 5 main_~c~0)} is VALID [2022-04-27 11:44:01,716 INFO L272 TraceCheckUtils]: 16: Hoare triple {511#(< 5 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:01,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {521#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:01,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {451#false} is VALID [2022-04-27 11:44:01,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-04-27 11:44:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:01,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:02,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-04-27 11:44:02,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {451#false} is VALID [2022-04-27 11:44:02,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {521#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:44:02,319 INFO L272 TraceCheckUtils]: 16: Hoare triple {456#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:44:02,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#(<= 0 main_~c~0)} assume !(~i~0 < 100); {456#(<= 0 main_~c~0)} is VALID [2022-04-27 11:44:02,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {456#(<= 0 main_~c~0)} is VALID [2022-04-27 11:44:02,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(<= 0 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {456#(<= 0 main_~c~0)} is VALID [2022-04-27 11:44:02,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#(<= 0 (+ main_~i~0 main_~c~0))} assume !(~i~0 <= 0); {455#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:02,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {556#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {455#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-27 11:44:02,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} assume !(~i~0 <= 0); {556#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-27 11:44:02,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {556#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-27 11:44:02,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#(<= (div main_~c~0 (- 2)) 3)} assume !(~i~0 <= 0); {563#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-27 11:44:02,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {567#(<= (div main_~c~0 (- 2)) 3)} is VALID [2022-04-27 11:44:02,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#true} assume !!(0 == ~c~0 && 0 == ~i~0); {571#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} is VALID [2022-04-27 11:44:02,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {450#true} is VALID [2022-04-27 11:44:02,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret3 := main(); {450#true} is VALID [2022-04-27 11:44:02,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #50#return; {450#true} is VALID [2022-04-27 11:44:02,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-04-27 11:44:02,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#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); {450#true} is VALID [2022-04-27 11:44:02,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2022-04-27 11:44:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:02,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889904641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:02,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:02,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2022-04-27 11:44:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854113119] [2022-04-27 11:44:02,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:02,326 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:44:02,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:02,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:02,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:44:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:44:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:44:02,360 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:02,653 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 11:44:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:44:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:44:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 11:44:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 11:44:02,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-27 11:44:02,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:02,676 INFO L225 Difference]: With dead ends: 21 [2022-04-27 11:44:02,676 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:02,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:44:02,678 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:02,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:44:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:02,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:02,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:02,679 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:02,679 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:02,679 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:02,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:02,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:02,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:44:02,679 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:44:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:02,680 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:02,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:02,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:02,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:02,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:02,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 11:44:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:02,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:02,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:02,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:44:02,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:44:02,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:02,959 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:02,959 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:02,959 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:02,959 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-27 11:44:02,960 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 11:44:02,960 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 11:44:02,960 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:44:02,960 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 11:44:02,960 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse0 (<= 0 main_~c~0)) (.cse1 (< 2 main_~i~0))) (or (and (<= main_~i~0 1) .cse0 (<= 1 main_~i~0)) (and .cse1 (< main_~i~0 100) (< 2 main_~c~0)) (and (<= main_~i~0 0) .cse0 (<= 0 main_~i~0)) (and .cse1 (< 5 main_~c~0)) (and (< 0 main_~c~0) (< 1 main_~i~0) (< main_~i~0 99)))) [2022-04-27 11:44:02,960 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (< 2 main_~i~0) (< 5 main_~c~0)) [2022-04-27 11:44:02,960 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-27 11:44:02,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:02,961 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:44:02,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:02,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:02,961 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:02,961 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:02,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:02,961 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:02,962 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:02,962 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:02,962 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:02,962 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:02,962 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:02,965 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 11:44:02,967 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:02,970 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:02,970 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:02,971 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:02,972 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:02,973 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:02,979 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 11:44:02,979 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:44:02,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:02 BoogieIcfgContainer [2022-04-27 11:44:02,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:02,992 INFO L158 Benchmark]: Toolchain (without parser) took 3623.42ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 127.5MB in the beginning and 182.1MB in the end (delta: -54.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:02,992 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 178.3MB. Free memory was 143.7MB in the beginning and 143.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:02,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.56ms. Allocated memory is still 178.3MB. Free memory was 127.4MB in the beginning and 153.3MB in the end (delta: -25.9MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-27 11:44:02,993 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:44:02,993 INFO L158 Benchmark]: RCFGBuilder took 234.82ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:02,993 INFO L158 Benchmark]: TraceAbstraction took 3164.88ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.7MB in the beginning and 182.1MB in the end (delta: -41.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:02,994 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.25ms. Allocated memory is still 178.3MB. Free memory was 143.7MB in the beginning and 143.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.56ms. Allocated memory is still 178.3MB. Free memory was 127.4MB in the beginning and 153.3MB in the end (delta: -25.9MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.82ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3164.88ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.7MB in the beginning and 182.1MB in the end (delta: -41.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 54 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 26, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 66 HoareAnnotationTreeSize, 10 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 4 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 18/51 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((i <= 1 && 0 <= c) && 1 <= i) || ((2 < i && i < 100) && 2 < c)) || ((i <= 0 && 0 <= c) && 0 <= i)) || (2 < i && 5 < c)) || ((0 < c && 1 < i) && i < 99) RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:03,016 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...