./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/bitvector/s3_clnt_2.BV.c.cil-2a.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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 425afc8b22e60c0a2f2550983f32b043f3f437d4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:25,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:25,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:25,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:25,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:25,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:25,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:25,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:25,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:25,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:25,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:25,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:25,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:25,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:25,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:25,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:25,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:25,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:25,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:25,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:25,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:25,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:25,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:25,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:25,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:25,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:25,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:25,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:25,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:25,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:25,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:25,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:25,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:25,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:25,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:25,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:25,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:25,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:25,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:25,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:25,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:25,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:25,134 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:25,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:25,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:25,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:25,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:25,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:25,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:25,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:25,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:25,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:25,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:25,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:25,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:25,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:25,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:25,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:25,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:25,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:25,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:25,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:25,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:25,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:25,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:25,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:25,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:25,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:25,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:25,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:25,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:25,144 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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-28 15:38:25,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:25,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:25,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:25,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:25,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:25,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:25,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27fe49e3/fca385c9cc564cd6930e26aa3d146161/FLAG36722f273 [2019-11-28 15:38:26,013 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:26,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:26,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27fe49e3/fca385c9cc564cd6930e26aa3d146161/FLAG36722f273 [2019-11-28 15:38:26,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27fe49e3/fca385c9cc564cd6930e26aa3d146161 [2019-11-28 15:38:26,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:26,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:26,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:26,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:26,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:26,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67de52c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26, skipping insertion in model container [2019-11-28 15:38:26,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:26,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:26,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:26,712 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:26,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:26,883 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:26,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26 WrapperNode [2019-11-28 15:38:26,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:26,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:26,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:26,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:26,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:26,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:26,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:26,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:26,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (1/1) ... [2019-11-28 15:38:26,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:26,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:26,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:26,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:26,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (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 [2019-11-28 15:38:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:27,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:27,186 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:27,751 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:38:27,752 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:38:27,753 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:27,754 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:27,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:27 BoogieIcfgContainer [2019-11-28 15:38:27,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:27,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:27,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:27,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:27,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:26" (1/3) ... [2019-11-28 15:38:27,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1707037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:27, skipping insertion in model container [2019-11-28 15:38:27,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:26" (2/3) ... [2019-11-28 15:38:27,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1707037a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:27, skipping insertion in model container [2019-11-28 15:38:27,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:27" (3/3) ... [2019-11-28 15:38:27,764 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:27,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:27,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:27,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:27,824 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:27,824 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:27,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:27,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:27,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:27,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:27,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:27,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-28 15:38:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:27,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:27,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:27,857 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:27,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:27,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-28 15:38:27,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:27,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096309843] [2019-11-28 15:38:27,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:28,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096309843] [2019-11-28 15:38:28,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:28,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:28,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863701285] [2019-11-28 15:38:28,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:28,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:28,129 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-28 15:38:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:28,386 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-28 15:38:28,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:28,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:38:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:28,401 INFO L225 Difference]: With dead ends: 245 [2019-11-28 15:38:28,401 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 15:38:28,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 15:38:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-28 15:38:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 15:38:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-28 15:38:28,452 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-28 15:38:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:28,453 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-28 15:38:28,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-28 15:38:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:38:28,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:28,455 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-11-28 15:38:28,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-28 15:38:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:28,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575268820] [2019-11-28 15:38:28,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:28,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575268820] [2019-11-28 15:38:28,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:28,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:28,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194418987] [2019-11-28 15:38:28,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:28,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:28,575 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-28 15:38:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:28,776 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-28 15:38:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:28,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 15:38:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:28,779 INFO L225 Difference]: With dead ends: 232 [2019-11-28 15:38:28,782 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 15:38:28,784 INFO L630 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 [2019-11-28 15:38:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 15:38:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-28 15:38:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 15:38:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-28 15:38:28,815 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-28 15:38:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:28,816 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-28 15:38:28,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-28 15:38:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 15:38:28,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:28,820 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-28 15:38:28,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:28,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-28 15:38:28,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:28,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218351016] [2019-11-28 15:38:28,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:28,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218351016] [2019-11-28 15:38:28,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:28,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:28,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476707199] [2019-11-28 15:38:28,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:28,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:28,958 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-28 15:38:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:29,159 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-28 15:38:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:29,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-28 15:38:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:29,162 INFO L225 Difference]: With dead ends: 264 [2019-11-28 15:38:29,162 INFO L226 Difference]: Without dead ends: 147 [2019-11-28 15:38:29,163 INFO L630 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 [2019-11-28 15:38:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-28 15:38:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-28 15:38:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 15:38:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-28 15:38:29,179 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-28 15:38:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:29,180 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-28 15:38:29,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-28 15:38:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:38:29,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:29,187 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:29,188 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-28 15:38:29,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:29,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194834286] [2019-11-28 15:38:29,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:29,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194834286] [2019-11-28 15:38:29,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:29,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:29,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580484877] [2019-11-28 15:38:29,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:29,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:29,313 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-28 15:38:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:29,344 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-28 15:38:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:29,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:38:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:29,346 INFO L225 Difference]: With dead ends: 298 [2019-11-28 15:38:29,347 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 15:38:29,348 INFO L630 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 [2019-11-28 15:38:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 15:38:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-28 15:38:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-28 15:38:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-28 15:38:29,363 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-28 15:38:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:29,364 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-28 15:38:29,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-28 15:38:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:38:29,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:29,370 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:29,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-28 15:38:29,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:29,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596705595] [2019-11-28 15:38:29,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:29,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596705595] [2019-11-28 15:38:29,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:29,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:29,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717587270] [2019-11-28 15:38:29,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:29,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:29,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:29,466 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-28 15:38:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:29,664 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-28 15:38:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:29,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:38:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:29,667 INFO L225 Difference]: With dead ends: 369 [2019-11-28 15:38:29,667 INFO L226 Difference]: Without dead ends: 213 [2019-11-28 15:38:29,668 INFO L630 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 [2019-11-28 15:38:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-28 15:38:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-28 15:38:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-28 15:38:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-28 15:38:29,685 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-28 15:38:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:29,685 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-28 15:38:29,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-28 15:38:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:38:29,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:29,691 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:29,691 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-28 15:38:29,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:29,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456450869] [2019-11-28 15:38:29,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:29,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456450869] [2019-11-28 15:38:29,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:29,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:29,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672073752] [2019-11-28 15:38:29,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:29,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:29,782 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-28 15:38:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:29,921 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-28 15:38:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:29,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:38:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:29,924 INFO L225 Difference]: With dead ends: 424 [2019-11-28 15:38:29,924 INFO L226 Difference]: Without dead ends: 228 [2019-11-28 15:38:29,925 INFO L630 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 [2019-11-28 15:38:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-28 15:38:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-28 15:38:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 15:38:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-28 15:38:29,933 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-28 15:38:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:29,933 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-28 15:38:29,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-28 15:38:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 15:38:29,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:29,935 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:29,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-28 15:38:29,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:29,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477168937] [2019-11-28 15:38:29,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:38:29,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477168937] [2019-11-28 15:38:29,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:29,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:29,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266146915] [2019-11-28 15:38:29,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:29,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:29,985 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-28 15:38:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:30,144 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-28 15:38:30,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:30,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 15:38:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:30,148 INFO L225 Difference]: With dead ends: 463 [2019-11-28 15:38:30,148 INFO L226 Difference]: Without dead ends: 248 [2019-11-28 15:38:30,149 INFO L630 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 [2019-11-28 15:38:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-28 15:38:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-28 15:38:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 15:38:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-28 15:38:30,159 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-28 15:38:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-28 15:38:30,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-28 15:38:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 15:38:30,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:30,161 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:30,162 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-28 15:38:30,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:30,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110702588] [2019-11-28 15:38:30,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:38:30,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110702588] [2019-11-28 15:38:30,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:30,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:30,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200702303] [2019-11-28 15:38:30,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:30,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:30,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:30,258 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-28 15:38:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:30,306 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-28 15:38:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:30,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-28 15:38:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:30,310 INFO L225 Difference]: With dead ends: 694 [2019-11-28 15:38:30,310 INFO L226 Difference]: Without dead ends: 458 [2019-11-28 15:38:30,311 INFO L630 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 [2019-11-28 15:38:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-28 15:38:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-28 15:38:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-28 15:38:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-28 15:38:30,327 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-28 15:38:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:30,327 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-28 15:38:30,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-28 15:38:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:38:30,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:30,330 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:30,330 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-28 15:38:30,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:30,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272304338] [2019-11-28 15:38:30,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 15:38:30,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272304338] [2019-11-28 15:38:30,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:30,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:30,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717747393] [2019-11-28 15:38:30,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:30,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:30,393 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-28 15:38:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:30,443 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-28 15:38:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:30,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:38:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:30,447 INFO L225 Difference]: With dead ends: 673 [2019-11-28 15:38:30,448 INFO L226 Difference]: Without dead ends: 671 [2019-11-28 15:38:30,449 INFO L630 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 [2019-11-28 15:38:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-28 15:38:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-28 15:38:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-28 15:38:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-28 15:38:30,472 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-28 15:38:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-28 15:38:30,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-28 15:38:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-28 15:38:30,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:30,476 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-28 15:38:30,476 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-28 15:38:30,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:30,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627210112] [2019-11-28 15:38:30,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-28 15:38:30,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627210112] [2019-11-28 15:38:30,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:30,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:30,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92557329] [2019-11-28 15:38:30,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:30,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:30,565 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-28 15:38:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:30,752 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-28 15:38:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:30,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-28 15:38:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:30,759 INFO L225 Difference]: With dead ends: 1483 [2019-11-28 15:38:30,759 INFO L226 Difference]: Without dead ends: 818 [2019-11-28 15:38:30,761 INFO L630 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 [2019-11-28 15:38:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-28 15:38:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-28 15:38:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-28 15:38:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-28 15:38:30,794 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-28 15:38:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:30,794 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-28 15:38:30,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-28 15:38:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-28 15:38:30,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:30,799 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:30,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-28 15:38:30,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:30,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608713730] [2019-11-28 15:38:30,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-28 15:38:30,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608713730] [2019-11-28 15:38:30,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:30,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:30,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458904015] [2019-11-28 15:38:30,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:30,876 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-28 15:38:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:31,057 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-28 15:38:31,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:31,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-28 15:38:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:31,063 INFO L225 Difference]: With dead ends: 1845 [2019-11-28 15:38:31,064 INFO L226 Difference]: Without dead ends: 1015 [2019-11-28 15:38:31,065 INFO L630 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 [2019-11-28 15:38:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-28 15:38:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-28 15:38:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-28 15:38:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-28 15:38:31,094 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-28 15:38:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:31,095 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-28 15:38:31,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-28 15:38:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-28 15:38:31,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:31,099 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-28 15:38:31,099 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-28 15:38:31,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:31,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 15:38:31,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:38:31,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 15:38:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:31,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:31,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712615865] [2019-11-28 15:38:31,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:31,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:31,340 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-28 15:38:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:31,388 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-28 15:38:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:31,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-28 15:38:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:31,398 INFO L225 Difference]: With dead ends: 2279 [2019-11-28 15:38:31,399 INFO L226 Difference]: Without dead ends: 1311 [2019-11-28 15:38:31,401 INFO L630 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 [2019-11-28 15:38:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-28 15:38:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-28 15:38:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-28 15:38:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-28 15:38:31,457 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-28 15:38:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:31,458 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-28 15:38:31,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-28 15:38:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 15:38:31,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:31,468 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1] [2019-11-28 15:38:31,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-28 15:38:31,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:31,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50117667] [2019-11-28 15:38:31,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-28 15:38:31,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50117667] [2019-11-28 15:38:31,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:31,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:31,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193669643] [2019-11-28 15:38:31,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:31,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:31,659 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-28 15:38:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:31,742 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-28 15:38:31,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:31,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-28 15:38:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:31,754 INFO L225 Difference]: With dead ends: 3667 [2019-11-28 15:38:31,755 INFO L226 Difference]: Without dead ends: 2365 [2019-11-28 15:38:31,758 INFO L630 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 [2019-11-28 15:38:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-28 15:38:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-28 15:38:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-28 15:38:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-28 15:38:31,835 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-28 15:38:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:31,838 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-28 15:38:31,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-28 15:38:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 15:38:31,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:31,844 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:38:31,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-28 15:38:31,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:31,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575588991] [2019-11-28 15:38:31,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:32,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:38:32,103 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:32,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:32 BoogieIcfgContainer [2019-11-28 15:38:32,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:32,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:32,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:32,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:32,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:27" (3/4) ... [2019-11-28 15:38:32,247 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 15:38:32,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:32,250 INFO L168 Benchmark]: Toolchain (without parser) took 5909.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -269.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:32,251 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:32,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:32,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.07 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. [2019-11-28 15:38:32,254 INFO L168 Benchmark]: Boogie Preprocessor took 40.63 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:32,259 INFO L168 Benchmark]: RCFGBuilder took 768.86 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:32,260 INFO L168 Benchmark]: TraceAbstraction took 4484.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -146.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:32,261 INFO L168 Benchmark]: Witness Printer took 6.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:32,269 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.07 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 40.63 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.86 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: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4484.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -146.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 607]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 355. Possible FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.2s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:34,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:34,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:34,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:34,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:34,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:34,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:34,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:34,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:34,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:34,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:34,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:34,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:34,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:34,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:34,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:34,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:34,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:34,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:34,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:34,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:34,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:34,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:34,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:34,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:34,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:34,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:34,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:34,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:34,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:34,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:34,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:34,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:34,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:34,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:34,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:34,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:34,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:34,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:34,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:34,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:34,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 15:38:34,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:34,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:34,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:34,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:34,395 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:34,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:34,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:34,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:34,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:34,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:34,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:34,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:34,397 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 15:38:34,397 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 15:38:34,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:34,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:34,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:34,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:34,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:34,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:34,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:34,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:34,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:34,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:34,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:34,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:34,400 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 15:38:34,400 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 15:38:34,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:34,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:34,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 15:38:34,401 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-28 15:38:34,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:34,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:34,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:34,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:34,775 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:34,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:34,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3312b4c4/7f75c984e6a04d91ad4eacb18190009c/FLAG8ee7c3ab5 [2019-11-28 15:38:35,274 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:35,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:35,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3312b4c4/7f75c984e6a04d91ad4eacb18190009c/FLAG8ee7c3ab5 [2019-11-28 15:38:35,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3312b4c4/7f75c984e6a04d91ad4eacb18190009c [2019-11-28 15:38:35,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:35,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:35,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:35,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:35,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:35,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:35" (1/1) ... [2019-11-28 15:38:35,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:35, skipping insertion in model container [2019-11-28 15:38:35,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:35" (1/1) ... [2019-11-28 15:38:35,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:35,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:35,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:35,991 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:36,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:36,173 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:36,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36 WrapperNode [2019-11-28 15:38:36,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:36,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:36,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:36,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:36,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:36,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:36,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:36,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:36,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (1/1) ... [2019-11-28 15:38:36,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:36,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:36,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:36,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:36,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (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 [2019-11-28 15:38:36,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:36,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:36,508 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:37,134 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:38:37,135 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:38:37,136 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:37,137 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:37,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:37 BoogieIcfgContainer [2019-11-28 15:38:37,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:37,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:37,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:37,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:37,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:35" (1/3) ... [2019-11-28 15:38:37,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e06b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:37, skipping insertion in model container [2019-11-28 15:38:37,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:36" (2/3) ... [2019-11-28 15:38:37,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6e06b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:37, skipping insertion in model container [2019-11-28 15:38:37,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:37" (3/3) ... [2019-11-28 15:38:37,146 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-28 15:38:37,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:37,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:37,178 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:37,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:37,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:37,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:37,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:37,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:37,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:37,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:37,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-28 15:38:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:38:37,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:37,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:37,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-28 15:38:37,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:37,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882677033] [2019-11-28 15:38:37,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:37,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:37,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:37,414 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:37,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882677033] [2019-11-28 15:38:37,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:37,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 15:38:37,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406006612] [2019-11-28 15:38:37,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:37,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:37,457 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-28 15:38:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:37,691 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-28 15:38:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:37,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:38:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:37,706 INFO L225 Difference]: With dead ends: 245 [2019-11-28 15:38:37,706 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 15:38:37,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 15:38:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-28 15:38:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 15:38:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-28 15:38:37,762 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-28 15:38:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:37,763 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-28 15:38:37,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-28 15:38:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:38:37,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:37,768 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-11-28 15:38:37,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 15:38:37,981 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-28 15:38:37,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:37,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677762379] [2019-11-28 15:38:37,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:38,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:38,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:38,076 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:38,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677762379] [2019-11-28 15:38:38,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:38,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:38,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828528608] [2019-11-28 15:38:38,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:38,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:38,086 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-28 15:38:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:38,289 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-28 15:38:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:38,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 15:38:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:38,291 INFO L225 Difference]: With dead ends: 232 [2019-11-28 15:38:38,292 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 15:38:38,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 15:38:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-28 15:38:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 15:38:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-28 15:38:38,318 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-28 15:38:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:38,318 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-28 15:38:38,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-28 15:38:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 15:38:38,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:38,325 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-28 15:38:38,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 15:38:38,540 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-28 15:38:38,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:38,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561917032] [2019-11-28 15:38:38,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:38,618 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:38,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:38,643 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:38,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561917032] [2019-11-28 15:38:38,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:38,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:38,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602352834] [2019-11-28 15:38:38,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:38,667 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-28 15:38:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:38,846 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-28 15:38:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:38,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-28 15:38:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:38,849 INFO L225 Difference]: With dead ends: 264 [2019-11-28 15:38:38,849 INFO L226 Difference]: Without dead ends: 147 [2019-11-28 15:38:38,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-28 15:38:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-28 15:38:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 15:38:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-28 15:38:38,881 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-28 15:38:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:38,881 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-28 15:38:38,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-28 15:38:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:38:38,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:38,886 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:39,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 15:38:39,088 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-28 15:38:39,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:39,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479074763] [2019-11-28 15:38:39,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:39,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:39,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:39,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:38:39,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479074763] [2019-11-28 15:38:39,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:39,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:39,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538758096] [2019-11-28 15:38:39,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:39,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:39,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:39,215 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-28 15:38:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:39,247 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-28 15:38:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:39,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:38:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:39,250 INFO L225 Difference]: With dead ends: 298 [2019-11-28 15:38:39,251 INFO L226 Difference]: Without dead ends: 164 [2019-11-28 15:38:39,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-28 15:38:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-28 15:38:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-28 15:38:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-28 15:38:39,266 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-28 15:38:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:39,266 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-28 15:38:39,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-28 15:38:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:38:39,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:39,269 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:39,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 15:38:39,480 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-28 15:38:39,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:39,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925952657] [2019-11-28 15:38:39,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:39,561 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:39,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:39,582 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:39,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925952657] [2019-11-28 15:38:39,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:39,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:38:39,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327292107] [2019-11-28 15:38:39,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:39,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:39,598 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-28 15:38:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:39,921 INFO L93 Difference]: Finished difference Result 390 states and 587 transitions. [2019-11-28 15:38:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:39,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-28 15:38:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:39,923 INFO L225 Difference]: With dead ends: 390 [2019-11-28 15:38:39,924 INFO L226 Difference]: Without dead ends: 235 [2019-11-28 15:38:39,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-28 15:38:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-11-28 15:38:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-28 15:38:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2019-11-28 15:38:39,940 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 66 [2019-11-28 15:38:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:39,940 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2019-11-28 15:38:39,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2019-11-28 15:38:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:39,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:39,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:40,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,159 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1464883036, now seen corresponding path program 1 times [2019-11-28 15:38:40,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:40,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769753513] [2019-11-28 15:38:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:40,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:40,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:40,273 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:38:40,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769753513] [2019-11-28 15:38:40,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:40,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:40,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447630310] [2019-11-28 15:38:40,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:40,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:40,289 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand 3 states. [2019-11-28 15:38:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:40,462 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2019-11-28 15:38:40,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:40,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:38:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:40,465 INFO L225 Difference]: With dead ends: 468 [2019-11-28 15:38:40,465 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 15:38:40,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 15:38:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2019-11-28 15:38:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-28 15:38:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 347 transitions. [2019-11-28 15:38:40,478 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 347 transitions. Word has length 67 [2019-11-28 15:38:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:40,478 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 347 transitions. [2019-11-28 15:38:40,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 347 transitions. [2019-11-28 15:38:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:38:40,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:40,481 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:40,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,693 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:40,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1271135886, now seen corresponding path program 1 times [2019-11-28 15:38:40,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:40,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288156639] [2019-11-28 15:38:40,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:40,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:40,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:38:40,819 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:38:40,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288156639] [2019-11-28 15:38:40,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:40,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:40,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634249024] [2019-11-28 15:38:40,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:40,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:40,832 INFO L87 Difference]: Start difference. First operand 246 states and 347 transitions. Second operand 3 states. [2019-11-28 15:38:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:41,023 INFO L93 Difference]: Finished difference Result 507 states and 723 transitions. [2019-11-28 15:38:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:41,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:38:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:41,027 INFO L225 Difference]: With dead ends: 507 [2019-11-28 15:38:41,027 INFO L226 Difference]: Without dead ends: 270 [2019-11-28 15:38:41,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-28 15:38:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-11-28 15:38:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-28 15:38:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 373 transitions. [2019-11-28 15:38:41,041 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 373 transitions. Word has length 83 [2019-11-28 15:38:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:41,043 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 373 transitions. [2019-11-28 15:38:41,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 373 transitions. [2019-11-28 15:38:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 15:38:41,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:41,045 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:41,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 15:38:41,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-28 15:38:41,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:41,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936110187] [2019-11-28 15:38:41,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:41,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:41,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:38:41,363 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:38:41,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936110187] [2019-11-28 15:38:41,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:41,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:38:41,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859368467] [2019-11-28 15:38:41,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:41,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:41,391 INFO L87 Difference]: Start difference. First operand 267 states and 373 transitions. Second operand 4 states. [2019-11-28 15:38:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:41,483 INFO L93 Difference]: Finished difference Result 784 states and 1095 transitions. [2019-11-28 15:38:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:41,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-28 15:38:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:41,488 INFO L225 Difference]: With dead ends: 784 [2019-11-28 15:38:41,489 INFO L226 Difference]: Without dead ends: 526 [2019-11-28 15:38:41,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-28 15:38:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-11-28 15:38:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-11-28 15:38:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2019-11-28 15:38:41,532 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 102 [2019-11-28 15:38:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:41,533 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2019-11-28 15:38:41,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2019-11-28 15:38:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:38:41,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:41,538 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:41,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 15:38:41,752 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash 302681874, now seen corresponding path program 1 times [2019-11-28 15:38:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:41,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951485241] [2019-11-28 15:38:41,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:41,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:41,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-28 15:38:41,846 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-28 15:38:41,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951485241] [2019-11-28 15:38:41,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:41,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 15:38:41,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510353468] [2019-11-28 15:38:41,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:41,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:41,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:41,865 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand 3 states. [2019-11-28 15:38:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:41,905 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2019-11-28 15:38:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:41,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-28 15:38:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:41,909 INFO L225 Difference]: With dead ends: 1069 [2019-11-28 15:38:41,910 INFO L226 Difference]: Without dead ends: 552 [2019-11-28 15:38:41,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-11-28 15:38:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-11-28 15:38:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-28 15:38:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 761 transitions. [2019-11-28 15:38:41,929 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 761 transitions. Word has length 103 [2019-11-28 15:38:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:41,929 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 761 transitions. [2019-11-28 15:38:41,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 761 transitions. [2019-11-28 15:38:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:38:41,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:41,932 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:42,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 15:38:42,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-28 15:38:42,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:42,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735926722] [2019-11-28 15:38:42,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:42,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:42,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 15:38:42,252 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 15:38:42,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735926722] [2019-11-28 15:38:42,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:42,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:38:42,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728251663] [2019-11-28 15:38:42,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:42,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:42,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:42,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:42,268 INFO L87 Difference]: Start difference. First operand 552 states and 761 transitions. Second operand 4 states. [2019-11-28 15:38:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:42,356 INFO L93 Difference]: Finished difference Result 1519 states and 2112 transitions. [2019-11-28 15:38:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:42,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-28 15:38:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:42,363 INFO L225 Difference]: With dead ends: 1519 [2019-11-28 15:38:42,364 INFO L226 Difference]: Without dead ends: 1002 [2019-11-28 15:38:42,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-11-28 15:38:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-11-28 15:38:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-28 15:38:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1391 transitions. [2019-11-28 15:38:42,401 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1391 transitions. Word has length 104 [2019-11-28 15:38:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:42,402 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1391 transitions. [2019-11-28 15:38:42,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1391 transitions. [2019-11-28 15:38:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-28 15:38:42,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:42,406 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-28 15:38:42,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 15:38:42,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-28 15:38:42,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:42,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753834428] [2019-11-28 15:38:42,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:42,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:42,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-28 15:38:42,777 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-28 15:38:42,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753834428] [2019-11-28 15:38:42,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:42,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:38:42,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670402208] [2019-11-28 15:38:42,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:42,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:42,848 INFO L87 Difference]: Start difference. First operand 1002 states and 1391 transitions. Second operand 4 states. [2019-11-28 15:38:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:43,142 INFO L93 Difference]: Finished difference Result 2090 states and 2937 transitions. [2019-11-28 15:38:43,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:43,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-28 15:38:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:43,150 INFO L225 Difference]: With dead ends: 2090 [2019-11-28 15:38:43,150 INFO L226 Difference]: Without dead ends: 1123 [2019-11-28 15:38:43,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-28 15:38:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2019-11-28 15:38:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-11-28 15:38:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1499 transitions. [2019-11-28 15:38:43,192 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1499 transitions. Word has length 172 [2019-11-28 15:38:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:43,192 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1499 transitions. [2019-11-28 15:38:43,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1499 transitions. [2019-11-28 15:38:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-28 15:38:43,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:43,201 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-28 15:38:43,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 15:38:43,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-28 15:38:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:43,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444755858] [2019-11-28 15:38:43,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:43,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:43,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:38:43,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-28 15:38:43,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444755858] [2019-11-28 15:38:43,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:43,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:43,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293875779] [2019-11-28 15:38:43,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:43,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:43,707 INFO L87 Difference]: Start difference. First operand 1094 states and 1499 transitions. Second operand 3 states. [2019-11-28 15:38:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:43,776 INFO L93 Difference]: Finished difference Result 2408 states and 3303 transitions. [2019-11-28 15:38:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:43,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-28 15:38:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:43,784 INFO L225 Difference]: With dead ends: 2408 [2019-11-28 15:38:43,784 INFO L226 Difference]: Without dead ends: 1349 [2019-11-28 15:38:43,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-11-28 15:38:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2019-11-28 15:38:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-11-28 15:38:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1846 transitions. [2019-11-28 15:38:43,842 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1846 transitions. Word has length 193 [2019-11-28 15:38:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:43,842 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 1846 transitions. [2019-11-28 15:38:43,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1846 transitions. [2019-11-28 15:38:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 15:38:43,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:43,847 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:38:44,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 15:38:44,061 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-28 15:38:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480645074] [2019-11-28 15:38:44,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 15:38:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:44,462 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 15:38:44,462 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:44,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 15:38:44,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:44 BoogieIcfgContainer [2019-11-28 15:38:44,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:44,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:44,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:44,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:44,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:37" (3/4) ... [2019-11-28 15:38:44,792 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:38:44,969 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:38:44,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:44,972 INFO L168 Benchmark]: Toolchain (without parser) took 9295.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -55.7 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,972 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:44,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.79 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,973 INFO L168 Benchmark]: Boogie Preprocessor took 75.72 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,973 INFO L168 Benchmark]: RCFGBuilder took 807.71 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,974 INFO L168 Benchmark]: TraceAbstraction took 7648.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.1 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,974 INFO L168 Benchmark]: Witness Printer took 181.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:44,976 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.79 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.72 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 807.71 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7648.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.1 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. * Witness Printer took 181.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.4s, OverallIterations: 13, TraceHistogramMax: 11, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2277 SDtfs, 1035 SDslu, 1531 SDs, 0 SdLazy, 923 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 2086 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1349occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1258 NumberOfCodeBlocks, 1258 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2102 ConstructedInterpolants, 0 QuantifiedInterpolants, 455437 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 3388/3388 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...