/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/benchmark04_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:27:41,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:27:41,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:27:41,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:27:41,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:27:41,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:27:41,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:27:41,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:27:41,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:27:41,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:27:41,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:27:41,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:27:41,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:27:41,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:27:41,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:27:41,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:27:41,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:27:41,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:27:41,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:27:41,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:27:41,514 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:27:41,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:27:41,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:27:41,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:27:41,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:27:41,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:27:41,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:27:41,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:27:41,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:27:41,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:27:41,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:27:41,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:27:41,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:27:41,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:27:41,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:27:41,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:27:41,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:27:41,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:27:41,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:27:41,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:27:41,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:27:41,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:27:41,529 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-07 12:27:41,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:27:41,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:27:41,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:27:41,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:27:41,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:27:41,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:27:41,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:27:41,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:27:41,554 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:27:41,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:27:41,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:27:41,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:27:41,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:27:41,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:27:41,557 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-07 12:27:41,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:27:41,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:27:41,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:27:41,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:27:41,772 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:27:41,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-07 12:27:41,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a793e8/3731e22bcc5942ecb0b1247b3a24c7a6/FLAG15a70730b [2022-04-07 12:27:42,184 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:27:42,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-07 12:27:42,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a793e8/3731e22bcc5942ecb0b1247b3a24c7a6/FLAG15a70730b [2022-04-07 12:27:42,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325a793e8/3731e22bcc5942ecb0b1247b3a24c7a6 [2022-04-07 12:27:42,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:27:42,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:27:42,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:27:42,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:27:42,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:27:42,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aecfdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42, skipping insertion in model container [2022-04-07 12:27:42,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:27:42,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:27:42,373 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/benchmark04_conjunctive.i[873,886] [2022-04-07 12:27:42,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:27:42,393 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:27:42,403 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/benchmark04_conjunctive.i[873,886] [2022-04-07 12:27:42,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:27:42,422 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:27:42,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42 WrapperNode [2022-04-07 12:27:42,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:27:42,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:27:42,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:27:42,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:27:42,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:27:42,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:27:42,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:27:42,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:27:42,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (1/1) ... [2022-04-07 12:27:42,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:27:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:42,479 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-07 12:27:42,499 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-07 12:27:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:27:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:27:42,515 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:27:42,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:27:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:27:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:27:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:27:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:27:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:27:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:27:42,579 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:27:42,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:27:42,682 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:27:42,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:27:42,686 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:27:42,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:27:42 BoogieIcfgContainer [2022-04-07 12:27:42,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:27:42,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:27:42,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:27:42,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:27:42,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:27:42" (1/3) ... [2022-04-07 12:27:42,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a5b120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:27:42, skipping insertion in model container [2022-04-07 12:27:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:27:42" (2/3) ... [2022-04-07 12:27:42,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a5b120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:27:42, skipping insertion in model container [2022-04-07 12:27:42,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:27:42" (3/3) ... [2022-04-07 12:27:42,692 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.i [2022-04-07 12:27:42,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:27:42,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:27:42,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:27:42,768 INFO L340 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 [2022-04-07 12:27:42,768 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:27:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:27:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:27:42,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:42,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:42,790 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-07 12:27:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926042737] [2022-04-07 12:27:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:43,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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); {23#true} is VALID [2022-04-07 12:27:43,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-07 12:27:43,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-07 12:27:43,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:43,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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); {23#true} is VALID [2022-04-07 12:27:43,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-07 12:27:43,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-07 12:27:43,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-07 12:27:43,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-07 12:27:43,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {28#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-07 12:27:43,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~j~0 1) main_~n~0)} assume !(~j~0 <= ~n~0 - 1); {24#false} is VALID [2022-04-07 12:27:43,014 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {24#false} is VALID [2022-04-07 12:27:43,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-07 12:27:43,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-07 12:27:43,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-07 12:27:43,014 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-07 12:27:43,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926042737] [2022-04-07 12:27:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926042737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:27:43,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:27:43,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:27:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576167468] [2022-04-07 12:27:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:27:43,021 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-07 12:27:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:43,024 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-07 12:27:43,044 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-07 12:27:43,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 12:27:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 12:27:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 12:27:43,064 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-07 12:27:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,189 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 12:27:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 12:27:43,189 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-07 12:27:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:43,190 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-07 12:27:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-07 12:27:43,195 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-07 12:27:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-07 12:27:43,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-07 12:27:43,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:43,245 INFO L225 Difference]: With dead ends: 33 [2022-04-07 12:27:43,245 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 12:27:43,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:27:43,250 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:43,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:27:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 12:27:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 12:27:43,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:43,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 12:27:43,274 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 12:27:43,274 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 12:27:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,276 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 12:27:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 12:27:43,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:43,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:43,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 12:27:43,277 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 12:27:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,281 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 12:27:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 12:27:43,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:43,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:43,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:43,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 12:27:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 12:27:43,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 12:27:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:43,285 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 12:27:43,286 INFO L479 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-07 12:27:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 12:27:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 12:27:43,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:43,292 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:43,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:27:43,293 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-07 12:27:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:43,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214536866] [2022-04-07 12:27:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:43,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(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); {127#true} is VALID [2022-04-07 12:27:43,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-07 12:27:43,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-07 12:27:43,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:43,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#(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); {127#true} is VALID [2022-04-07 12:27:43,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-07 12:27:43,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-07 12:27:43,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-07 12:27:43,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-07 12:27:43,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {132#(<= 1 main_~k~0)} is VALID [2022-04-07 12:27:43,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= 1 main_~k~0)} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,411 INFO L272 TraceCheckUtils]: 9: Hoare triple {133#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:27:43,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:27:43,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {128#false} is VALID [2022-04-07 12:27:43,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-07 12:27:43,413 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-07 12:27:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214536866] [2022-04-07 12:27:43,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214536866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990798504] [2022-04-07 12:27:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:43,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:43,415 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-07 12:27:43,415 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-07 12:27:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:43,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 12:27:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:43,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:43,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-07 12:27:43,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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); {127#true} is VALID [2022-04-07 12:27:43,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-07 12:27:43,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-07 12:27:43,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-07 12:27:43,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-07 12:27:43,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {132#(<= 1 main_~k~0)} is VALID [2022-04-07 12:27:43,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= 1 main_~k~0)} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,613 INFO L272 TraceCheckUtils]: 9: Hoare triple {133#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {167#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:43,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:43,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-07 12:27:43,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-07 12:27:43,614 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-07 12:27:43,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:43,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-07 12:27:43,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {128#false} is VALID [2022-04-07 12:27:43,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:43,777 INFO L272 TraceCheckUtils]: 9: Hoare triple {133#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {167#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:43,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= 1 main_~k~0)} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {133#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:43,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {132#(<= 1 main_~k~0)} is VALID [2022-04-07 12:27:43,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {127#true} is VALID [2022-04-07 12:27:43,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret6 := main(); {127#true} is VALID [2022-04-07 12:27:43,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-07 12:27:43,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-07 12:27:43,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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); {127#true} is VALID [2022-04-07 12:27:43,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-07 12:27:43,784 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-07 12:27:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990798504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:27:43,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:27:43,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-07 12:27:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991821152] [2022-04-07 12:27:43,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:27:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:27:43,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:43,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:43,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:43,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:27:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:27:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:27:43,804 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,915 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 12:27:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:27:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:27:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-07 12:27:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-07 12:27:43,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-07 12:27:43,931 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-07 12:27:43,932 INFO L225 Difference]: With dead ends: 20 [2022-04-07 12:27:43,932 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 12:27:43,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:27:43,934 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:43,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:27:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 12:27:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 12:27:43,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:43,938 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-07 12:27:43,938 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-07 12:27:43,939 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-07 12:27:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,939 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:27:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:27:43,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:43,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:43,940 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-07 12:27:43,940 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-07 12:27:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:43,941 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:27:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:27:43,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:43,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:43,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:43,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:43,942 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-07 12:27:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 12:27:43,943 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 12:27:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:43,943 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 12:27:43,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:27:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 12:27:43,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:43,944 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:43,965 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-07 12:27:44,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:44,161 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 2 times [2022-04-07 12:27:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:44,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816616661] [2022-04-07 12:27:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:44,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:44,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#(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); {309#true} is VALID [2022-04-07 12:27:44,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-07 12:27:44,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #45#return; {309#true} is VALID [2022-04-07 12:27:44,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:44,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#(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); {309#true} is VALID [2022-04-07 12:27:44,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-07 12:27:44,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #45#return; {309#true} is VALID [2022-04-07 12:27:44,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret6 := main(); {309#true} is VALID [2022-04-07 12:27:44,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {309#true} is VALID [2022-04-07 12:27:44,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {314#(<= main_~n~0 (+ main_~k~0 main_~j~0))} is VALID [2022-04-07 12:27:44,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(<= main_~n~0 (+ main_~k~0 main_~j~0))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {314#(<= main_~n~0 (+ main_~k~0 main_~j~0))} is VALID [2022-04-07 12:27:44,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(<= main_~n~0 (+ main_~k~0 main_~j~0))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,247 INFO L272 TraceCheckUtils]: 10: Hoare triple {315#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {316#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:27:44,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {317#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:27:44,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {310#false} is VALID [2022-04-07 12:27:44,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-07 12:27:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 12:27:44,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:44,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816616661] [2022-04-07 12:27:44,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816616661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:44,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393599784] [2022-04-07 12:27:44,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:27:44,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:44,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:44,250 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-07 12:27:44,251 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-07 12:27:44,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:27:44,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:27:44,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:27:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:44,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:44,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2022-04-07 12:27:44,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#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); {309#true} is VALID [2022-04-07 12:27:44,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-07 12:27:44,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #45#return; {309#true} is VALID [2022-04-07 12:27:44,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret6 := main(); {309#true} is VALID [2022-04-07 12:27:44,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {309#true} is VALID [2022-04-07 12:27:44,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {340#(and (<= 0 main_~j~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-07 12:27:44,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(and (<= 0 main_~j~0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {344#(and (<= 1 main_~j~0) (<= main_~n~0 (+ main_~k~0 1)))} is VALID [2022-04-07 12:27:44,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#(and (<= 1 main_~j~0) (<= main_~n~0 (+ main_~k~0 1)))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,461 INFO L272 TraceCheckUtils]: 10: Hoare triple {315#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {354#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:44,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {358#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:44,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {358#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {310#false} is VALID [2022-04-07 12:27:44,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-07 12:27:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:44,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:44,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-07 12:27:44,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {358#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {310#false} is VALID [2022-04-07 12:27:44,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {358#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:44,636 INFO L272 TraceCheckUtils]: 10: Hoare triple {315#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {354#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:44,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= 0 main_~k~0)} assume !(~j~0 <= ~n~0 - 1); {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(or (<= 1 main_~k~0) (not (<= (+ main_~j~0 1) main_~n~0)))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {315#(<= 0 main_~k~0)} is VALID [2022-04-07 12:27:44,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(or (<= 2 main_~k~0) (< main_~n~0 (+ main_~j~0 2)))} assume !!(~j~0 <= ~n~0 - 1);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {380#(or (<= 1 main_~k~0) (not (<= (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-07 12:27:44,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !!((~n~0 >= 1 && ~k~0 >= ~n~0) && 0 == ~j~0); {384#(or (<= 2 main_~k~0) (< main_~n~0 (+ main_~j~0 2)))} is VALID [2022-04-07 12:27:44,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {309#true} is VALID [2022-04-07 12:27:44,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret6 := main(); {309#true} is VALID [2022-04-07 12:27:44,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #45#return; {309#true} is VALID [2022-04-07 12:27:44,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-07 12:27:44,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#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); {309#true} is VALID [2022-04-07 12:27:44,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2022-04-07 12:27:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:27:44,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393599784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:27:44,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:27:44,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-07 12:27:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854410465] [2022-04-07 12:27:44,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:27:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:27:44,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:44,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:44,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:44,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 12:27:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 12:27:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:27:44,655 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:44,794 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:27:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:27:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:27:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-07 12:27:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-07 12:27:44,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-07 12:27:44,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:44,807 INFO L225 Difference]: With dead ends: 15 [2022-04-07 12:27:44,807 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:27:44,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:27:44,808 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:44,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:27:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:27:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:27:44,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:44,809 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-07 12:27:44,809 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-07 12:27:44,809 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-07 12:27:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:44,810 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:27:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:44,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:44,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:44,810 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-07 12:27:44,810 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-07 12:27:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:44,810 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:27:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:44,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:44,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:44,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:44,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:44,810 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-07 12:27:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:27:44,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 12:27:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:44,811 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:27:44,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:27:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:27:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:44,813 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:27:44,831 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-07 12:27:45,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 12:27:45,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-07 12:27:45,069 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-07 12:27:45,069 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= 0 main_~k~0)) [2022-04-07 12:27:45,070 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (<= 0 main_~k~0) [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L878 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-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:27:45,070 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-07 12:27:45,070 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-07 12:27:45,071 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 12:27:45,073 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 12:27:45,073 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:27:45,075 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:27:45,076 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:27:45,077 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:27:45,077 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:27:45,081 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 12:27:45,081 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:27:45,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:27:45 BoogieIcfgContainer [2022-04-07 12:27:45,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:27:45,087 INFO L158 Benchmark]: Toolchain (without parser) took 2884.22ms. Allocated memory was 190.8MB in the beginning and 240.1MB in the end (delta: 49.3MB). Free memory was 139.8MB in the beginning and 129.6MB in the end (delta: 10.2MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2022-04-07 12:27:45,087 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 190.8MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:27:45,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.39ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 165.6MB in the end (delta: -26.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-07 12:27:45,088 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 164.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 12:27:45,088 INFO L158 Benchmark]: RCFGBuilder took 230.83ms. Allocated memory is still 190.8MB. Free memory was 164.0MB in the beginning and 153.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 12:27:45,088 INFO L158 Benchmark]: TraceAbstraction took 2398.20ms. Allocated memory was 190.8MB in the beginning and 240.1MB in the end (delta: 49.3MB). Free memory was 152.5MB in the beginning and 129.6MB in the end (delta: 22.9MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2022-04-07 12:27:45,089 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.14ms. Allocated memory is still 190.8MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.39ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 165.6MB in the end (delta: -26.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 164.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 230.83ms. Allocated memory is still 190.8MB. Free memory was 164.0MB in the beginning and 153.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2398.20ms. Allocated memory was 190.8MB in the beginning and 240.1MB in the end (delta: 49.3MB). Free memory was 152.5MB in the beginning and 129.6MB in the end (delta: 22.9MB). Peak memory consumption was 72.7MB. 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 38 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 23 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 9 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/12 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: 24]: Loop Invariant Derived loop invariant: n <= k + j && 0 <= k RESULT: Ultimate proved your program to be correct! [2022-04-07 12:27:45,113 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...