./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_io_1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_io_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69c831b1eda23dac6e2f4454b4feebfba511ade3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:04:39,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:04:39,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:04:39,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:04:39,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:04:39,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:04:39,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:04:39,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:04:39,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:04:39,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:04:39,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:04:39,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:04:39,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:04:39,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:04:39,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:04:39,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:04:39,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:04:39,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:04:39,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:04:39,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:04:39,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:04:39,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:04:39,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:04:39,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:04:39,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:04:39,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:04:39,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:04:39,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:04:39,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:04:39,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:04:39,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:04:39,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:04:39,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:04:39,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:04:39,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:04:39,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:04:39,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:04:39,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:04:39,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:04:39,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:04:39,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:04:39,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:04:39,229 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:04:39,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:04:39,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:04:39,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:04:39,237 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:04:39,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:04:39,238 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:04:39,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:04:39,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:04:39,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:04:39,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:04:39,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:04:39,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:04:39,241 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:04:39,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:04:39,242 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:04:39,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:04:39,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:04:39,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:04:39,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:04:39,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:04:39,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:04:39,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:04:39,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:04:39,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:04:39,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:04:39,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:04:39,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:04:39,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:04:39,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69c831b1eda23dac6e2f4454b4feebfba511ade3 [2020-07-28 17:04:39,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:04:39,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:04:39,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:04:39,648 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:04:39,649 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:04:39,650 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_io_1.c [2020-07-28 17:04:39,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9b8f816/ee4d887273d14ea1a0dad26b2b4bc6ac/FLAG13339eaba [2020-07-28 17:04:40,220 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:04:40,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2020-07-28 17:04:40,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9b8f816/ee4d887273d14ea1a0dad26b2b4bc6ac/FLAG13339eaba [2020-07-28 17:04:40,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9b8f816/ee4d887273d14ea1a0dad26b2b4bc6ac [2020-07-28 17:04:40,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:04:40,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:04:40,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:04:40,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:04:40,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:04:40,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:40,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5777ae3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40, skipping insertion in model container [2020-07-28 17:04:40,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:40,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:04:40,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:04:40,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:04:40,849 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:04:40,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:04:40,966 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:04:40,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40 WrapperNode [2020-07-28 17:04:40,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:04:40,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:04:40,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:04:40,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:04:40,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:40,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:04:41,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:04:41,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:04:41,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:04:41,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... [2020-07-28 17:04:41,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:04:41,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:04:41,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:04:41,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:04:41,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:04:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:04:41,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:04:41,872 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:04:41,873 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-28 17:04:41,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:04:41 BoogieIcfgContainer [2020-07-28 17:04:41,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:04:41,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:04:41,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:04:41,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:04:41,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:04:40" (1/3) ... [2020-07-28 17:04:41,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806af52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:04:41, skipping insertion in model container [2020-07-28 17:04:41,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:04:40" (2/3) ... [2020-07-28 17:04:41,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806af52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:04:41, skipping insertion in model container [2020-07-28 17:04:41,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:04:41" (3/3) ... [2020-07-28 17:04:41,888 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2020-07-28 17:04:41,898 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:04:41,906 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:04:41,920 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:04:41,943 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:04:41,943 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:04:41,943 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:04:41,943 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:04:41,944 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:04:41,944 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:04:41,944 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:04:41,944 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:04:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-28 17:04:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:04:41,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:41,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:41,971 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 352571312, now seen corresponding path program 1 times [2020-07-28 17:04:41,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:41,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668735319] [2020-07-28 17:04:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:42,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {71#true} is VALID [2020-07-28 17:04:42,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {71#true} is VALID [2020-07-28 17:04:42,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {71#true} goto; {71#true} is VALID [2020-07-28 17:04:42,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {71#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {71#true} is VALID [2020-07-28 17:04:42,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {71#true} is VALID [2020-07-28 17:04:42,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {71#true} is VALID [2020-07-28 17:04:42,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {71#true} main_~method_id~0 := 2; {71#true} is VALID [2020-07-28 17:04:42,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} assume false; {72#false} is VALID [2020-07-28 17:04:42,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-28 17:04:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:04:42,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668735319] [2020-07-28 17:04:42,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:42,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:04:42,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776494534] [2020-07-28 17:04:42,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:04:42,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:42,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:04:42,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:42,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:04:42,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:04:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:04:42,229 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2020-07-28 17:04:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:42,424 INFO L93 Difference]: Finished difference Result 130 states and 244 transitions. [2020-07-28 17:04:42,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:04:42,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:04:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:04:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2020-07-28 17:04:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:04:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2020-07-28 17:04:42,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 244 transitions. [2020-07-28 17:04:42,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:42,839 INFO L225 Difference]: With dead ends: 130 [2020-07-28 17:04:42,840 INFO L226 Difference]: Without dead ends: 57 [2020-07-28 17:04:42,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:04:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-28 17:04:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-28 17:04:42,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:42,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-28 17:04:42,897 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-28 17:04:42,898 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-28 17:04:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:42,907 INFO L93 Difference]: Finished difference Result 57 states and 87 transitions. [2020-07-28 17:04:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2020-07-28 17:04:42,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:42,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:42,911 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-28 17:04:42,911 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-28 17:04:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:42,921 INFO L93 Difference]: Finished difference Result 57 states and 87 transitions. [2020-07-28 17:04:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2020-07-28 17:04:42,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:42,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:42,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:42,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-28 17:04:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2020-07-28 17:04:42,937 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 9 [2020-07-28 17:04:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:42,938 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2020-07-28 17:04:42,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:04:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2020-07-28 17:04:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:04:42,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:42,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:42,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:04:42,941 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697760, now seen corresponding path program 1 times [2020-07-28 17:04:42,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:42,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394411472] [2020-07-28 17:04:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:43,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {387#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {387#true} is VALID [2020-07-28 17:04:43,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {387#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {389#(= 0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {389#(= 0 ULTIMATE.start_main_~q~0)} goto; {389#(= 0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,052 INFO L280 TraceCheckUtils]: 3: Hoare triple {389#(= 0 ULTIMATE.start_main_~q~0)} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {389#(= 0 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {389#(= 0 ULTIMATE.start_main_~q~0)} assume !(0 == main_~q~0); {388#false} is VALID [2020-07-28 17:04:43,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {388#false} assume 1 == main_~q~0;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {388#false} is VALID [2020-07-28 17:04:43,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {388#false} assume 0 != main_#t~nondet5;havoc main_#t~nondet5; {388#false} is VALID [2020-07-28 17:04:43,056 INFO L280 TraceCheckUtils]: 7: Hoare triple {388#false} main_~method_id~0 := 4; {388#false} is VALID [2020-07-28 17:04:43,057 INFO L280 TraceCheckUtils]: 8: Hoare triple {388#false} assume 0 != main_~this_sink~0; {388#false} is VALID [2020-07-28 17:04:43,058 INFO L280 TraceCheckUtils]: 9: Hoare triple {388#false} assume !false; {388#false} is VALID [2020-07-28 17:04:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:04:43,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394411472] [2020-07-28 17:04:43,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:43,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:04:43,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040499959] [2020-07-28 17:04:43,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:04:43,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:43,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:04:43,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:43,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:04:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:04:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:43,091 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand 3 states. [2020-07-28 17:04:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:43,300 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2020-07-28 17:04:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:04:43,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:04:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-28 17:04:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-28 17:04:43,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-28 17:04:43,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:43,574 INFO L225 Difference]: With dead ends: 115 [2020-07-28 17:04:43,575 INFO L226 Difference]: Without dead ends: 60 [2020-07-28 17:04:43,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-28 17:04:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-28 17:04:43,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:43,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-28 17:04:43,591 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-28 17:04:43,591 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-28 17:04:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:43,595 INFO L93 Difference]: Finished difference Result 60 states and 90 transitions. [2020-07-28 17:04:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2020-07-28 17:04:43,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:43,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:43,601 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-28 17:04:43,601 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-28 17:04:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:43,605 INFO L93 Difference]: Finished difference Result 60 states and 90 transitions. [2020-07-28 17:04:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2020-07-28 17:04:43,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:43,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:43,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:43,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-28 17:04:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2020-07-28 17:04:43,612 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 10 [2020-07-28 17:04:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:43,612 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-07-28 17:04:43,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:04:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2020-07-28 17:04:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:04:43,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:43,615 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:43,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:04:43,616 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 658032531, now seen corresponding path program 1 times [2020-07-28 17:04:43,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:43,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927617976] [2020-07-28 17:04:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:43,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {700#true} is VALID [2020-07-28 17:04:43,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {700#true} is VALID [2020-07-28 17:04:43,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} goto; {700#true} is VALID [2020-07-28 17:04:43,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {700#true} is VALID [2020-07-28 17:04:43,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {700#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {700#true} is VALID [2020-07-28 17:04:43,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {700#true} is VALID [2020-07-28 17:04:43,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} main_~method_id~0 := 2; {700#true} is VALID [2020-07-28 17:04:43,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {700#true} assume !false;main_~q~0 := 2;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {702#(<= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#(<= 2 ULTIMATE.start_main_~q~0)} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {702#(<= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#(<= 2 ULTIMATE.start_main_~q~0)} assume !(0 == main_~q~0); {702#(<= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:43,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {702#(<= 2 ULTIMATE.start_main_~q~0)} assume 1 == main_~q~0;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {701#false} is VALID [2020-07-28 17:04:43,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {701#false} assume 0 != main_#t~nondet5;havoc main_#t~nondet5; {701#false} is VALID [2020-07-28 17:04:43,711 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#false} main_~method_id~0 := 4; {701#false} is VALID [2020-07-28 17:04:43,712 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#false} assume 0 != main_~this_sink~0; {701#false} is VALID [2020-07-28 17:04:43,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-28 17:04:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:04:43,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927617976] [2020-07-28 17:04:43,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:43,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:04:43,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632846140] [2020-07-28 17:04:43,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-28 17:04:43,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:43,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:04:43,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:43,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:04:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:04:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:43,746 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 3 states. [2020-07-28 17:04:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:43,882 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2020-07-28 17:04:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:04:43,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-28 17:04:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2020-07-28 17:04:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2020-07-28 17:04:43,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2020-07-28 17:04:44,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:44,077 INFO L225 Difference]: With dead ends: 109 [2020-07-28 17:04:44,078 INFO L226 Difference]: Without dead ends: 52 [2020-07-28 17:04:44,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-28 17:04:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-28 17:04:44,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:44,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-28 17:04:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-28 17:04:44,101 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-28 17:04:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,104 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2020-07-28 17:04:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2020-07-28 17:04:44,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:44,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-28 17:04:44,105 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-28 17:04:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,108 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2020-07-28 17:04:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2020-07-28 17:04:44,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:44,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:44,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:44,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-28 17:04:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2020-07-28 17:04:44,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 15 [2020-07-28 17:04:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:44,112 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2020-07-28 17:04:44,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:04:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2020-07-28 17:04:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:04:44,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:44,114 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:44,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:04:44,114 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2017993163, now seen corresponding path program 1 times [2020-07-28 17:04:44,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:44,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363665539] [2020-07-28 17:04:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:44,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {984#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {984#true} is VALID [2020-07-28 17:04:44,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {984#true} is VALID [2020-07-28 17:04:44,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {984#true} goto; {984#true} is VALID [2020-07-28 17:04:44,164 INFO L280 TraceCheckUtils]: 3: Hoare triple {984#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {984#true} is VALID [2020-07-28 17:04:44,164 INFO L280 TraceCheckUtils]: 4: Hoare triple {984#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {984#true} is VALID [2020-07-28 17:04:44,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {984#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {984#true} is VALID [2020-07-28 17:04:44,165 INFO L280 TraceCheckUtils]: 6: Hoare triple {984#true} main_~method_id~0 := 2; {984#true} is VALID [2020-07-28 17:04:44,166 INFO L280 TraceCheckUtils]: 7: Hoare triple {984#true} assume !false;main_~q~0 := 2;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(0 == main_~q~0); {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(1 == main_~q~0); {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume 2 == main_~q~0;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,171 INFO L280 TraceCheckUtils]: 12: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,172 INFO L280 TraceCheckUtils]: 13: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(0 != main_#t~nondet9);havoc main_#t~nondet9;assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume !(0 != main_#t~nondet11);havoc main_#t~nondet11;assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,175 INFO L280 TraceCheckUtils]: 16: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume 0 != main_#t~nondet12;havoc main_#t~nondet12; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} main_~method_id~0 := 4; {986#(= 0 ULTIMATE.start_main_~this_sink~0)} is VALID [2020-07-28 17:04:44,177 INFO L280 TraceCheckUtils]: 18: Hoare triple {986#(= 0 ULTIMATE.start_main_~this_sink~0)} assume 0 != main_~this_sink~0; {985#false} is VALID [2020-07-28 17:04:44,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {985#false} assume !false; {985#false} is VALID [2020-07-28 17:04:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:04:44,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363665539] [2020-07-28 17:04:44,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:44,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:04:44,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480363700] [2020-07-28 17:04:44,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 17:04:44,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:44,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:04:44,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:04:44,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:04:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:44,208 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 3 states. [2020-07-28 17:04:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,406 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2020-07-28 17:04:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:04:44,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 17:04:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-28 17:04:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-28 17:04:44,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2020-07-28 17:04:44,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:44,690 INFO L225 Difference]: With dead ends: 136 [2020-07-28 17:04:44,691 INFO L226 Difference]: Without dead ends: 90 [2020-07-28 17:04:44,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-28 17:04:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2020-07-28 17:04:44,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:44,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 87 states. [2020-07-28 17:04:44,715 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 87 states. [2020-07-28 17:04:44,715 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 87 states. [2020-07-28 17:04:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,720 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-28 17:04:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-28 17:04:44,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:44,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:44,722 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 90 states. [2020-07-28 17:04:44,722 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 90 states. [2020-07-28 17:04:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,726 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-28 17:04:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-28 17:04:44,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:44,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:44,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:44,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-28 17:04:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2020-07-28 17:04:44,732 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 20 [2020-07-28 17:04:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:44,733 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2020-07-28 17:04:44,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:04:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2020-07-28 17:04:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 17:04:44,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:44,734 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:44,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:04:44,735 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash 398483104, now seen corresponding path program 1 times [2020-07-28 17:04:44,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:44,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095262515] [2020-07-28 17:04:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:44,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {1410#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1410#true} is VALID [2020-07-28 17:04:44,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {1410#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {1410#true} is VALID [2020-07-28 17:04:44,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {1410#true} goto; {1410#true} is VALID [2020-07-28 17:04:44,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {1410#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {1410#true} is VALID [2020-07-28 17:04:44,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {1410#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1410#true} is VALID [2020-07-28 17:04:44,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {1410#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {1410#true} is VALID [2020-07-28 17:04:44,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {1410#true} main_~method_id~0 := 2; {1410#true} is VALID [2020-07-28 17:04:44,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {1410#true} assume !false;main_~q~0 := 2;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {1412#(= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:44,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {1412#(= 2 ULTIMATE.start_main_~q~0)} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {1412#(= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:44,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {1412#(= 2 ULTIMATE.start_main_~q~0)} assume !(0 == main_~q~0); {1412#(= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:44,783 INFO L280 TraceCheckUtils]: 10: Hoare triple {1412#(= 2 ULTIMATE.start_main_~q~0)} assume !(1 == main_~q~0); {1412#(= 2 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:44,784 INFO L280 TraceCheckUtils]: 11: Hoare triple {1412#(= 2 ULTIMATE.start_main_~q~0)} assume !(2 == main_~q~0); {1411#false} is VALID [2020-07-28 17:04:44,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {1411#false} assume 3 == main_~q~0;assume -2147483648 <= main_#t~nondet15 && main_#t~nondet15 <= 2147483647; {1411#false} is VALID [2020-07-28 17:04:44,785 INFO L280 TraceCheckUtils]: 13: Hoare triple {1411#false} assume !(0 != main_#t~nondet15);havoc main_#t~nondet15;assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; {1411#false} is VALID [2020-07-28 17:04:44,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {1411#false} assume !(0 != main_#t~nondet16);havoc main_#t~nondet16;assume -2147483648 <= main_#t~nondet17 && main_#t~nondet17 <= 2147483647; {1411#false} is VALID [2020-07-28 17:04:44,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {1411#false} assume !(0 != main_#t~nondet17);havoc main_#t~nondet17;assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; {1411#false} is VALID [2020-07-28 17:04:44,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {1411#false} assume !(0 != main_#t~nondet18);havoc main_#t~nondet18;assume -2147483648 <= main_#t~nondet19 && main_#t~nondet19 <= 2147483647; {1411#false} is VALID [2020-07-28 17:04:44,786 INFO L280 TraceCheckUtils]: 17: Hoare triple {1411#false} assume 0 != main_#t~nondet19;havoc main_#t~nondet19; {1411#false} is VALID [2020-07-28 17:04:44,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {1411#false} main_~method_id~0 := 4; {1411#false} is VALID [2020-07-28 17:04:44,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {1411#false} assume 0 == main_~this_sink~0; {1411#false} is VALID [2020-07-28 17:04:44,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2020-07-28 17:04:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:04:44,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095262515] [2020-07-28 17:04:44,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:44,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:04:44,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255801309] [2020-07-28 17:04:44,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 17:04:44,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:44,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:04:44,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:44,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:04:44,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:04:44,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:44,813 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand 3 states. [2020-07-28 17:04:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:44,935 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2020-07-28 17:04:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:04:44,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 17:04:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-28 17:04:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-28 17:04:44,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-28 17:04:45,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:45,097 INFO L225 Difference]: With dead ends: 176 [2020-07-28 17:04:45,097 INFO L226 Difference]: Without dead ends: 97 [2020-07-28 17:04:45,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-28 17:04:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2020-07-28 17:04:45,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:45,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 95 states. [2020-07-28 17:04:45,124 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 95 states. [2020-07-28 17:04:45,124 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 95 states. [2020-07-28 17:04:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,128 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2020-07-28 17:04:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2020-07-28 17:04:45,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:45,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:45,129 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 97 states. [2020-07-28 17:04:45,129 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 97 states. [2020-07-28 17:04:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,133 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2020-07-28 17:04:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2020-07-28 17:04:45,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:45,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:45,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:45,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-28 17:04:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2020-07-28 17:04:45,138 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 21 [2020-07-28 17:04:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:45,138 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2020-07-28 17:04:45,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:04:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2020-07-28 17:04:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-28 17:04:45,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:45,140 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:45,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 17:04:45,140 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash -162530645, now seen corresponding path program 1 times [2020-07-28 17:04:45,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:45,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045427123] [2020-07-28 17:04:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:45,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {1904#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1904#true} is VALID [2020-07-28 17:04:45,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {1904#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {1904#true} is VALID [2020-07-28 17:04:45,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {1904#true} goto; {1904#true} is VALID [2020-07-28 17:04:45,194 INFO L280 TraceCheckUtils]: 3: Hoare triple {1904#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {1904#true} is VALID [2020-07-28 17:04:45,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {1904#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {1904#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {1904#true} is VALID [2020-07-28 17:04:45,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {1904#true} main_~method_id~0 := 2; {1904#true} is VALID [2020-07-28 17:04:45,195 INFO L280 TraceCheckUtils]: 7: Hoare triple {1904#true} assume !false;main_~q~0 := 2;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {1904#true} is VALID [2020-07-28 17:04:45,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {1904#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {1904#true} is VALID [2020-07-28 17:04:45,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {1904#true} assume !(0 == main_~q~0); {1904#true} is VALID [2020-07-28 17:04:45,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {1904#true} assume !(1 == main_~q~0); {1904#true} is VALID [2020-07-28 17:04:45,196 INFO L280 TraceCheckUtils]: 11: Hoare triple {1904#true} assume 2 == main_~q~0;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,197 INFO L280 TraceCheckUtils]: 12: Hoare triple {1904#true} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {1904#true} assume !(0 != main_#t~nondet9);havoc main_#t~nondet9;assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {1904#true} assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {1904#true} assume !(0 != main_#t~nondet11);havoc main_#t~nondet11;assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {1904#true} assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;assume -2147483648 <= main_#t~nondet13 && main_#t~nondet13 <= 2147483647; {1904#true} is VALID [2020-07-28 17:04:45,198 INFO L280 TraceCheckUtils]: 17: Hoare triple {1904#true} assume 0 != main_#t~nondet13;havoc main_#t~nondet13; {1904#true} is VALID [2020-07-28 17:04:45,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {1904#true} assume 1 != main_~P2~0 && 0 != main_~P1~0;main_~method_id~0 := 5; {1904#true} is VALID [2020-07-28 17:04:45,199 INFO L280 TraceCheckUtils]: 19: Hoare triple {1904#true} assume !((0 != main_~this_sink~0 && 0 != main_~P1~0) && 1 != main_~P2~0 && 0 != main_~P1~0);main_~q~0 := 3;main_~this_sink~0 := main_~P1~0;main_~this_sinkConnected~0 := 1; {1906#(<= 3 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:45,200 INFO L280 TraceCheckUtils]: 20: Hoare triple {1906#(<= 3 ULTIMATE.start_main_~q~0)} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {1906#(<= 3 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:45,201 INFO L280 TraceCheckUtils]: 21: Hoare triple {1906#(<= 3 ULTIMATE.start_main_~q~0)} assume !(0 == main_~q~0); {1906#(<= 3 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:45,201 INFO L280 TraceCheckUtils]: 22: Hoare triple {1906#(<= 3 ULTIMATE.start_main_~q~0)} assume !(1 == main_~q~0); {1906#(<= 3 ULTIMATE.start_main_~q~0)} is VALID [2020-07-28 17:04:45,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {1906#(<= 3 ULTIMATE.start_main_~q~0)} assume 2 == main_~q~0;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {1905#false} is VALID [2020-07-28 17:04:45,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {1905#false} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; {1905#false} is VALID [2020-07-28 17:04:45,203 INFO L280 TraceCheckUtils]: 25: Hoare triple {1905#false} assume !(0 != main_#t~nondet9);havoc main_#t~nondet9;assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; {1905#false} is VALID [2020-07-28 17:04:45,203 INFO L280 TraceCheckUtils]: 26: Hoare triple {1905#false} assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; {1905#false} is VALID [2020-07-28 17:04:45,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {1905#false} assume !(0 != main_#t~nondet11);havoc main_#t~nondet11;assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; {1905#false} is VALID [2020-07-28 17:04:45,203 INFO L280 TraceCheckUtils]: 28: Hoare triple {1905#false} assume 0 != main_#t~nondet12;havoc main_#t~nondet12; {1905#false} is VALID [2020-07-28 17:04:45,204 INFO L280 TraceCheckUtils]: 29: Hoare triple {1905#false} main_~method_id~0 := 4; {1905#false} is VALID [2020-07-28 17:04:45,204 INFO L280 TraceCheckUtils]: 30: Hoare triple {1905#false} assume 0 != main_~this_sink~0; {1905#false} is VALID [2020-07-28 17:04:45,204 INFO L280 TraceCheckUtils]: 31: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2020-07-28 17:04:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:04:45,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045427123] [2020-07-28 17:04:45,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:45,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:04:45,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356805086] [2020-07-28 17:04:45,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-07-28 17:04:45,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:45,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:04:45,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:45,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:04:45,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:04:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:45,239 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand 3 states. [2020-07-28 17:04:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,357 INFO L93 Difference]: Finished difference Result 160 states and 230 transitions. [2020-07-28 17:04:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:04:45,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-07-28 17:04:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-28 17:04:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:04:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-28 17:04:45,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-28 17:04:45,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:45,503 INFO L225 Difference]: With dead ends: 160 [2020-07-28 17:04:45,503 INFO L226 Difference]: Without dead ends: 73 [2020-07-28 17:04:45,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:04:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-28 17:04:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-07-28 17:04:45,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:45,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2020-07-28 17:04:45,525 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2020-07-28 17:04:45,525 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2020-07-28 17:04:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,528 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2020-07-28 17:04:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-28 17:04:45,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:45,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:45,529 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2020-07-28 17:04:45,529 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2020-07-28 17:04:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,532 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2020-07-28 17:04:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-28 17:04:45,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:45,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:45,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:45,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-28 17:04:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-07-28 17:04:45,535 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 32 [2020-07-28 17:04:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:45,536 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-07-28 17:04:45,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:04:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-28 17:04:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-28 17:04:45,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:04:45,537 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:04:45,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 17:04:45,537 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:04:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:04:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1521721792, now seen corresponding path program 1 times [2020-07-28 17:04:45,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:04:45,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136606025] [2020-07-28 17:04:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:04:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:04:45,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {2311#true} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {2311#true} is VALID [2020-07-28 17:04:45,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {2311#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_~P1~0, main_~P2~0, main_~P3~0, main_~P4~0, main_~q~0, main_~method_id~0, main_~this_sink~0, main_~this_sinkConnected~0;main_~q~0 := 0;havoc main_~method_id~0;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {2311#true} is VALID [2020-07-28 17:04:45,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {2311#true} goto; {2311#true} is VALID [2020-07-28 17:04:45,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {2311#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {2311#true} is VALID [2020-07-28 17:04:45,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {2311#true} assume 0 == main_~q~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {2311#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {2311#true} is VALID [2020-07-28 17:04:45,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {2311#true} main_~method_id~0 := 2; {2311#true} is VALID [2020-07-28 17:04:45,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {2311#true} assume !false;main_~q~0 := 2;main_~this_sink~0 := 0;main_~this_sinkConnected~0 := 0; {2311#true} is VALID [2020-07-28 17:04:45,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {2311#true} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {2311#true} is VALID [2020-07-28 17:04:45,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {2311#true} assume !(0 == main_~q~0); {2311#true} is VALID [2020-07-28 17:04:45,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {2311#true} assume !(1 == main_~q~0); {2311#true} is VALID [2020-07-28 17:04:45,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {2311#true} assume 2 == main_~q~0;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {2311#true} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {2311#true} assume !(0 != main_#t~nondet9);havoc main_#t~nondet9;assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {2311#true} assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {2311#true} assume !(0 != main_#t~nondet11);havoc main_#t~nondet11;assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {2311#true} assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;assume -2147483648 <= main_#t~nondet13 && main_#t~nondet13 <= 2147483647; {2311#true} is VALID [2020-07-28 17:04:45,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {2311#true} assume 0 != main_#t~nondet13;havoc main_#t~nondet13; {2311#true} is VALID [2020-07-28 17:04:45,656 INFO L280 TraceCheckUtils]: 18: Hoare triple {2311#true} assume 1 != main_~P2~0 && 0 != main_~P1~0;main_~method_id~0 := 5; {2313#(or (<= (+ ULTIMATE.start_main_~P1~0 1) 0) (< 0 ULTIMATE.start_main_~P1~0))} is VALID [2020-07-28 17:04:45,659 INFO L280 TraceCheckUtils]: 19: Hoare triple {2313#(or (<= (+ ULTIMATE.start_main_~P1~0 1) 0) (< 0 ULTIMATE.start_main_~P1~0))} assume !((0 != main_~this_sink~0 && 0 != main_~P1~0) && 1 != main_~P2~0 && 0 != main_~P1~0);main_~q~0 := 3;main_~this_sink~0 := main_~P1~0;main_~this_sinkConnected~0 := 1; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,660 INFO L280 TraceCheckUtils]: 20: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !false;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~P1~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~P2~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~P3~0 := main_#t~nondet2;havoc main_#t~nondet2;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~P4~0 := main_#t~nondet3;havoc main_#t~nondet3; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,664 INFO L280 TraceCheckUtils]: 21: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(0 == main_~q~0); {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,665 INFO L280 TraceCheckUtils]: 22: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(1 == main_~q~0); {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,666 INFO L280 TraceCheckUtils]: 23: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(2 == main_~q~0); {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,667 INFO L280 TraceCheckUtils]: 24: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume 3 == main_~q~0;assume -2147483648 <= main_#t~nondet15 && main_#t~nondet15 <= 2147483647; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,668 INFO L280 TraceCheckUtils]: 25: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(0 != main_#t~nondet15);havoc main_#t~nondet15;assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,668 INFO L280 TraceCheckUtils]: 26: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(0 != main_#t~nondet16);havoc main_#t~nondet16;assume -2147483648 <= main_#t~nondet17 && main_#t~nondet17 <= 2147483647; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,670 INFO L280 TraceCheckUtils]: 27: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(0 != main_#t~nondet17);havoc main_#t~nondet17;assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,671 INFO L280 TraceCheckUtils]: 28: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume !(0 != main_#t~nondet18);havoc main_#t~nondet18;assume -2147483648 <= main_#t~nondet19 && main_#t~nondet19 <= 2147483647; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,672 INFO L280 TraceCheckUtils]: 29: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume 0 != main_#t~nondet19;havoc main_#t~nondet19; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,673 INFO L280 TraceCheckUtils]: 30: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} main_~method_id~0 := 4; {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} is VALID [2020-07-28 17:04:45,673 INFO L280 TraceCheckUtils]: 31: Hoare triple {2314#(or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0))} assume 0 == main_~this_sink~0; {2312#false} is VALID [2020-07-28 17:04:45,674 INFO L280 TraceCheckUtils]: 32: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2020-07-28 17:04:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:04:45,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136606025] [2020-07-28 17:04:45,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:04:45,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:04:45,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848236039] [2020-07-28 17:04:45,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-28 17:04:45,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:04:45,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:04:45,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:45,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:04:45,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:04:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:04:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:04:45,717 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 4 states. [2020-07-28 17:04:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:45,916 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2020-07-28 17:04:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:04:45,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-07-28 17:04:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:04:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:04:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2020-07-28 17:04:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:04:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2020-07-28 17:04:45,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 103 transitions. [2020-07-28 17:04:46,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:04:46,020 INFO L225 Difference]: With dead ends: 76 [2020-07-28 17:04:46,020 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:04:46,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:04:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:04:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:04:46,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:04:46,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:04:46,023 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:04:46,023 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:04:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:46,023 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:04:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:04:46,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:46,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:46,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:04:46,024 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:04:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:04:46,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:04:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:04:46,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:46,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:04:46,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:04:46,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:04:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:04:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:04:46,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-07-28 17:04:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:04:46,026 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:04:46,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:04:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:04:46,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:04:46,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 17:04:46,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:04:46,136 INFO L268 CegarLoopResult]: For program point L36(lines 36 47) no Hoare annotation was computed. [2020-07-28 17:04:46,136 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:04:46,136 INFO L268 CegarLoopResult]: For program point L86(lines 86 101) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L53(lines 53 104) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L202(lines 202 217) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L70(lines 70 85) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L318(lines 318 333) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L186(lines 186 201) no Hoare annotation was computed. [2020-07-28 17:04:46,137 INFO L268 CegarLoopResult]: For program point L54(lines 54 69) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L264 CegarLoopResult]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_main_~this_sink~0))) (or (and .cse0 (= 2 ULTIMATE.start_main_~q~0)) (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and .cse0 (= 0 ULTIMATE.start_main_~q~0)))) [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L302(lines 302 317) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L170(lines 170 185) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L286(lines 286 301) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L154(lines 154 169) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L88(lines 88 99) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L270(lines 270 285) no Hoare annotation was computed. [2020-07-28 17:04:46,138 INFO L268 CegarLoopResult]: For program point L204(lines 204 215) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L138(lines 138 153) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L105(lines 105 220) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L72(lines 72 83) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L320(lines 320 331) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L254(lines 254 269) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L221(lines 221 336) no Hoare annotation was computed. [2020-07-28 17:04:46,139 INFO L268 CegarLoopResult]: For program point L188(lines 188 199) no Hoare annotation was computed. [2020-07-28 17:04:46,140 INFO L268 CegarLoopResult]: For program point L122(lines 122 137) no Hoare annotation was computed. [2020-07-28 17:04:46,140 INFO L268 CegarLoopResult]: For program point L56(lines 56 67) no Hoare annotation was computed. [2020-07-28 17:04:46,140 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 339) the Hoare annotation is: (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and (= 0 ULTIMATE.start_main_~this_sink~0) (= 0 ULTIMATE.start_main_~q~0))) [2020-07-28 17:04:46,140 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2020-07-28 17:04:46,141 INFO L268 CegarLoopResult]: For program point L304(lines 304 315) no Hoare annotation was computed. [2020-07-28 17:04:46,141 INFO L268 CegarLoopResult]: For program point L238(lines 238 253) no Hoare annotation was computed. [2020-07-28 17:04:46,141 INFO L268 CegarLoopResult]: For program point L172(lines 172 183) no Hoare annotation was computed. [2020-07-28 17:04:46,141 INFO L268 CegarLoopResult]: For program point L106(lines 106 121) no Hoare annotation was computed. [2020-07-28 17:04:46,141 INFO L268 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-07-28 17:04:46,142 INFO L268 CegarLoopResult]: For program point L288(lines 288 299) no Hoare annotation was computed. [2020-07-28 17:04:46,142 INFO L268 CegarLoopResult]: For program point L222(lines 222 237) no Hoare annotation was computed. [2020-07-28 17:04:46,142 INFO L268 CegarLoopResult]: For program point L156(lines 156 167) no Hoare annotation was computed. [2020-07-28 17:04:46,142 INFO L268 CegarLoopResult]: For program point L272(lines 272 283) no Hoare annotation was computed. [2020-07-28 17:04:46,142 INFO L268 CegarLoopResult]: For program point L140(lines 140 151) no Hoare annotation was computed. [2020-07-28 17:04:46,143 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:04:46,143 INFO L268 CegarLoopResult]: For program point L256(lines 256 267) no Hoare annotation was computed. [2020-07-28 17:04:46,143 INFO L268 CegarLoopResult]: For program point L124(lines 124 135) no Hoare annotation was computed. [2020-07-28 17:04:46,143 INFO L268 CegarLoopResult]: For program point L240(lines 240 251) no Hoare annotation was computed. [2020-07-28 17:04:46,143 INFO L268 CegarLoopResult]: For program point L108(lines 108 119) no Hoare annotation was computed. [2020-07-28 17:04:46,144 INFO L268 CegarLoopResult]: For program point L224(lines 224 235) no Hoare annotation was computed. [2020-07-28 17:04:46,144 INFO L268 CegarLoopResult]: For program point L92(lines 92 94) no Hoare annotation was computed. [2020-07-28 17:04:46,144 INFO L268 CegarLoopResult]: For program point L208(lines 208 210) no Hoare annotation was computed. [2020-07-28 17:04:46,144 INFO L268 CegarLoopResult]: For program point L76(lines 76 78) no Hoare annotation was computed. [2020-07-28 17:04:46,144 INFO L268 CegarLoopResult]: For program point L324(lines 324 326) no Hoare annotation was computed. [2020-07-28 17:04:46,145 INFO L268 CegarLoopResult]: For program point L192(lines 192 194) no Hoare annotation was computed. [2020-07-28 17:04:46,145 INFO L268 CegarLoopResult]: For program point L60(lines 60 62) no Hoare annotation was computed. [2020-07-28 17:04:46,145 INFO L268 CegarLoopResult]: For program point L308(lines 308 310) no Hoare annotation was computed. [2020-07-28 17:04:46,145 INFO L268 CegarLoopResult]: For program point L176(lines 176 178) no Hoare annotation was computed. [2020-07-28 17:04:46,145 INFO L264 CegarLoopResult]: At program point L325(lines 13 344) the Hoare annotation is: false [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point L292(lines 292 294) no Hoare annotation was computed. [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point L160(lines 160 162) no Hoare annotation was computed. [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point L276(lines 276 278) no Hoare annotation was computed. [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point L144(lines 144 146) no Hoare annotation was computed. [2020-07-28 17:04:46,146 INFO L268 CegarLoopResult]: For program point L260(lines 260 262) no Hoare annotation was computed. [2020-07-28 17:04:46,147 INFO L268 CegarLoopResult]: For program point L128(lines 128 130) no Hoare annotation was computed. [2020-07-28 17:04:46,147 INFO L268 CegarLoopResult]: For program point L244(lines 244 246) no Hoare annotation was computed. [2020-07-28 17:04:46,147 INFO L268 CegarLoopResult]: For program point L112(lines 112 114) no Hoare annotation was computed. [2020-07-28 17:04:46,147 INFO L271 CegarLoopResult]: At program point L13(lines 13 344) the Hoare annotation is: true [2020-07-28 17:04:46,147 INFO L268 CegarLoopResult]: For program point L228(lines 228 230) no Hoare annotation was computed. [2020-07-28 17:04:46,148 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:04:46,148 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2020-07-28 17:04:46,148 INFO L268 CegarLoopResult]: For program point L33(lines 33 52) no Hoare annotation was computed. [2020-07-28 17:04:46,148 INFO L268 CegarLoopResult]: For program point L34(lines 34 49) no Hoare annotation was computed. [2020-07-28 17:04:46,153 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:04:46,154 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:04:46,155 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 17:04:46,155 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 17:04:46,156 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:04:46,157 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:04:46,158 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:04:46,159 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:04:46,159 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-28 17:04:46,159 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-28 17:04:46,159 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2020-07-28 17:04:46,159 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-28 17:04:46,160 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-28 17:04:46,161 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-28 17:04:46,162 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-28 17:04:46,163 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-28 17:04:46,163 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-28 17:04:46,163 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2020-07-28 17:04:46,163 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-28 17:04:46,164 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2020-07-28 17:04:46,165 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2020-07-28 17:04:46,166 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2020-07-28 17:04:46,166 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2020-07-28 17:04:46,166 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-28 17:04:46,166 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-28 17:04:46,167 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-28 17:04:46,168 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-28 17:04:46,169 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-28 17:04:46,170 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-28 17:04:46,171 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2020-07-28 17:04:46,172 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2020-07-28 17:04:46,173 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2020-07-28 17:04:46,173 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2020-07-28 17:04:46,173 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2020-07-28 17:04:46,173 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2020-07-28 17:04:46,173 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2020-07-28 17:04:46,173 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:04:46,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:04:46 BoogieIcfgContainer [2020-07-28 17:04:46,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:04:46,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:04:46,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:04:46,189 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:04:46,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:04:41" (3/4) ... [2020-07-28 17:04:46,195 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:04:46,213 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 17:04:46,214 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 17:04:46,261 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:04:46,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:04:46,265 INFO L168 Benchmark]: Toolchain (without parser) took 5690.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 960.2 MB in the beginning and 910.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 250.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:04:46,266 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:04:46,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:04:46,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:04:46,271 INFO L168 Benchmark]: Boogie Preprocessor took 35.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:04:46,275 INFO L168 Benchmark]: RCFGBuilder took 805.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:04:46,280 INFO L168 Benchmark]: TraceAbstraction took 4308.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 917.9 MB in the end (delta: 147.8 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:04:46,282 INFO L168 Benchmark]: Witness Printer took 72.06 ms. Allocated memory is still 1.2 GB. Free memory was 917.9 MB in the beginning and 910.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:04:46,293 INFO L336 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 805.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4308.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 917.9 MB in the end (delta: 147.8 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.06 ms. Allocated memory is still 1.2 GB. Free memory was 917.9 MB in the beginning and 910.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (0 == this_sink && 0 == q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((0 == this_sink && 2 == q) || ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q)) || (0 == this_sink && 0 == q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 520 SDtfs, 190 SDslu, 262 SDs, 0 SdLazy, 88 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 4 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...