./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/forester-heap/dll-01-1.i -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 b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-27 23:54:03,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:54:03,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:54:03,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:54:03,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:54:03,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:54:03,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:54:03,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:54:03,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:54:03,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:54:03,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:54:03,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:54:03,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:54:03,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:54:03,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:54:03,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:54:03,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:54:03,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:54:03,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:54:03,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:54:03,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:54:03,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:54:03,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:54:03,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:54:03,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:54:03,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:54:03,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:54:03,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:54:03,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:54:03,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:54:03,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:54:03,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:54:03,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:54:03,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:54:03,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:54:03,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:54:03,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:54:03,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:54:03,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:54:03,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:54:03,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:54:03,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:54:03,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:54:03,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:54:03,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:54:03,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:54:03,201 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:54:03,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:54:03,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:54:03,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:54:03,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:54:03,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:54:03,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:54:03,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:54:03,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:54:03,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:54:03,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:54:03,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:54:03,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:54:03,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:54:03,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:54:03,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:54:03,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:54:03,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:54:03,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:54:03,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:54:03,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:54:03,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:54:03,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:54:03,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:54:03,207 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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2019-11-27 23:54:03,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:54:03,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:54:03,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:54:03,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:54:03,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:54:03,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2019-11-27 23:54:03,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51ee7340/0ade76a33b6244929ac8e2776a22e05b/FLAG562bd6688 [2019-11-27 23:54:04,184 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:54:04,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2019-11-27 23:54:04,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51ee7340/0ade76a33b6244929ac8e2776a22e05b/FLAG562bd6688 [2019-11-27 23:54:04,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51ee7340/0ade76a33b6244929ac8e2776a22e05b [2019-11-27 23:54:04,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:54:04,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:54:04,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:04,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:54:04,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:54:04,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:04" (1/1) ... [2019-11-27 23:54:04,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33519a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:04, skipping insertion in model container [2019-11-27 23:54:04,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:04" (1/1) ... [2019-11-27 23:54:04,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:54:04,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:54:04,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:04,980 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:54:05,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:05,103 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:54:05,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05 WrapperNode [2019-11-27 23:54:05,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:05,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:05,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:54:05,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:54:05,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:05,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:54:05,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:54:05,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:54:05,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (1/1) ... [2019-11-27 23:54:05,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:54:05,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:54:05,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:54:05,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:54:05,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (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-27 23:54:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:54:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:54:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:54:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:54:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:54:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:54:05,897 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:54:05,898 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:54:05,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:05 BoogieIcfgContainer [2019-11-27 23:54:05,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:54:05,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:54:05,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:54:05,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:54:05,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:54:04" (1/3) ... [2019-11-27 23:54:05,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51d0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:05, skipping insertion in model container [2019-11-27 23:54:05,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:05" (2/3) ... [2019-11-27 23:54:05,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d51d0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:05, skipping insertion in model container [2019-11-27 23:54:05,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:05" (3/3) ... [2019-11-27 23:54:05,908 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2019-11-27 23:54:05,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:54:05,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-27 23:54:05,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-27 23:54:05,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:54:05,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:54:05,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:54:05,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:54:05,973 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:54:05,973 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:54:05,974 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:54:05,974 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:54:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-11-27 23:54:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 23:54:06,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:06,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 23:54:06,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-27 23:54:06,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:06,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161031352] [2019-11-27 23:54:06,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:06,209 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-27 23:54:06,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161031352] [2019-11-27 23:54:06,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:06,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:06,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630431117] [2019-11-27 23:54:06,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:06,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:06,233 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-11-27 23:54:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:06,336 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-11-27 23:54:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:06,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-27 23:54:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:06,347 INFO L225 Difference]: With dead ends: 180 [2019-11-27 23:54:06,348 INFO L226 Difference]: Without dead ends: 95 [2019-11-27 23:54:06,351 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-27 23:54:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-27 23:54:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-11-27 23:54:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-27 23:54:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-27 23:54:06,394 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2019-11-27 23:54:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:06,394 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-27 23:54:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-27 23:54:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:54:06,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:06,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:06,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-27 23:54:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:06,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37263028] [2019-11-27 23:54:06,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:06,450 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-27 23:54:06,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37263028] [2019-11-27 23:54:06,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:06,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:06,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901127612] [2019-11-27 23:54:06,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:06,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:06,455 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2019-11-27 23:54:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:06,485 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-27 23:54:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:06,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 23:54:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:06,489 INFO L225 Difference]: With dead ends: 80 [2019-11-27 23:54:06,490 INFO L226 Difference]: Without dead ends: 78 [2019-11-27 23:54:06,491 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-27 23:54:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-27 23:54:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-27 23:54:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-27 23:54:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-27 23:54:06,501 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2019-11-27 23:54:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:06,501 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-27 23:54:06,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-27 23:54:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:54:06,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:06,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:06,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-27 23:54:06,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:06,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142324674] [2019-11-27 23:54:06,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:06,579 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-27 23:54:06,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142324674] [2019-11-27 23:54:06,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:06,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:06,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875224202] [2019-11-27 23:54:06,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:06,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:06,582 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2019-11-27 23:54:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:06,699 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-11-27 23:54:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:06,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 23:54:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:06,701 INFO L225 Difference]: With dead ends: 79 [2019-11-27 23:54:06,702 INFO L226 Difference]: Without dead ends: 77 [2019-11-27 23:54:06,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 23:54:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-27 23:54:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-27 23:54:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-27 23:54:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-11-27 23:54:06,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2019-11-27 23:54:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:06,712 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-11-27 23:54:06,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-11-27 23:54:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:54:06,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:06,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:06,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-27 23:54:06,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:06,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772369917] [2019-11-27 23:54:06,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:06,807 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-27 23:54:06,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772369917] [2019-11-27 23:54:06,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:06,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:06,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741397082] [2019-11-27 23:54:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:06,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:06,812 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2019-11-27 23:54:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:06,949 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2019-11-27 23:54:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:06,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-27 23:54:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:06,951 INFO L225 Difference]: With dead ends: 195 [2019-11-27 23:54:06,951 INFO L226 Difference]: Without dead ends: 128 [2019-11-27 23:54:06,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-27 23:54:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2019-11-27 23:54:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-27 23:54:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-27 23:54:06,962 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2019-11-27 23:54:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:06,962 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-27 23:54:06,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-27 23:54:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:54:06,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:06,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:06,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2019-11-27 23:54:06,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:06,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985867212] [2019-11-27 23:54:06,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,057 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-27 23:54:07,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985867212] [2019-11-27 23:54:07,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:07,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450398062] [2019-11-27 23:54:07,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:07,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:07,060 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-11-27 23:54:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:07,228 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-27 23:54:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:54:07,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 23:54:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:07,230 INFO L225 Difference]: With dead ends: 122 [2019-11-27 23:54:07,230 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 23:54:07,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:54:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 23:54:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2019-11-27 23:54:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-27 23:54:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-11-27 23:54:07,240 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2019-11-27 23:54:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-11-27 23:54:07,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-11-27 23:54:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:54:07,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:07,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:07,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-27 23:54:07,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:07,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144916069] [2019-11-27 23:54:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,307 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-27 23:54:07,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144916069] [2019-11-27 23:54:07,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:07,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33871394] [2019-11-27 23:54:07,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:07,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:07,311 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2019-11-27 23:54:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:07,413 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-27 23:54:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:07,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-27 23:54:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:07,414 INFO L225 Difference]: With dead ends: 132 [2019-11-27 23:54:07,415 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 23:54:07,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:54:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 23:54:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2019-11-27 23:54:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 23:54:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-11-27 23:54:07,424 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2019-11-27 23:54:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:07,424 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-11-27 23:54:07,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-11-27 23:54:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:54:07,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:07,426 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] [2019-11-27 23:54:07,426 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2019-11-27 23:54:07,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:07,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175148346] [2019-11-27 23:54:07,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,498 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-27 23:54:07,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175148346] [2019-11-27 23:54:07,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922769873] [2019-11-27 23:54:07,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:07,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:07,500 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-11-27 23:54:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:07,528 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2019-11-27 23:54:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:07,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:54:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:07,531 INFO L225 Difference]: With dead ends: 137 [2019-11-27 23:54:07,531 INFO L226 Difference]: Without dead ends: 96 [2019-11-27 23:54:07,532 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-27 23:54:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-27 23:54:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2019-11-27 23:54:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-27 23:54:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-11-27 23:54:07,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2019-11-27 23:54:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:07,540 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-11-27 23:54:07,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-11-27 23:54:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:54:07,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:07,542 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] [2019-11-27 23:54:07,542 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-27 23:54:07,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:07,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768582433] [2019-11-27 23:54:07,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,589 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-27 23:54:07,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768582433] [2019-11-27 23:54:07,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:07,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312713410] [2019-11-27 23:54:07,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:07,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:07,592 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-11-27 23:54:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:07,613 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-11-27 23:54:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:07,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:54:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:07,615 INFO L225 Difference]: With dead ends: 75 [2019-11-27 23:54:07,615 INFO L226 Difference]: Without dead ends: 73 [2019-11-27 23:54:07,617 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-27 23:54:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-27 23:54:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-27 23:54:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-27 23:54:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-27 23:54:07,627 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2019-11-27 23:54:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:07,628 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-27 23:54:07,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-27 23:54:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:54:07,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:07,629 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-27 23:54:07,629 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-27 23:54:07,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552894436] [2019-11-27 23:54:07,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,710 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-27 23:54:07,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552894436] [2019-11-27 23:54:07,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:07,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790101122] [2019-11-27 23:54:07,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:07,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:07,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:07,712 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-11-27 23:54:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:07,799 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-11-27 23:54:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:07,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-27 23:54:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:07,800 INFO L225 Difference]: With dead ends: 74 [2019-11-27 23:54:07,800 INFO L226 Difference]: Without dead ends: 72 [2019-11-27 23:54:07,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 23:54:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-27 23:54:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-11-27 23:54:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-27 23:54:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-11-27 23:54:07,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2019-11-27 23:54:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:07,818 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-11-27 23:54:07,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-11-27 23:54:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:54:07,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:07,821 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, 1] [2019-11-27 23:54:07,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-27 23:54:07,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:07,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553362546] [2019-11-27 23:54:07,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:07,963 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-27 23:54:07,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553362546] [2019-11-27 23:54:07,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:07,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:54:07,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875585357] [2019-11-27 23:54:07,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:54:07,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:54:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:07,969 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 6 states. [2019-11-27 23:54:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:08,256 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2019-11-27 23:54:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:54:08,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 23:54:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:08,259 INFO L225 Difference]: With dead ends: 175 [2019-11-27 23:54:08,260 INFO L226 Difference]: Without dead ends: 133 [2019-11-27 23:54:08,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:54:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-27 23:54:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-11-27 23:54:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-27 23:54:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-11-27 23:54:08,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2019-11-27 23:54:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:08,268 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-11-27 23:54:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:54:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-11-27 23:54:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:54:08,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:08,269 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, 1] [2019-11-27 23:54:08,270 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-27 23:54:08,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:08,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253185178] [2019-11-27 23:54:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:08,456 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-27 23:54:08,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253185178] [2019-11-27 23:54:08,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:08,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 23:54:08,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486556357] [2019-11-27 23:54:08,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:54:08,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:54:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:54:08,458 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 7 states. [2019-11-27 23:54:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:09,156 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2019-11-27 23:54:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:54:09,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-27 23:54:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:09,160 INFO L225 Difference]: With dead ends: 234 [2019-11-27 23:54:09,160 INFO L226 Difference]: Without dead ends: 232 [2019-11-27 23:54:09,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:54:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-27 23:54:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2019-11-27 23:54:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 23:54:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-27 23:54:09,170 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2019-11-27 23:54:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:09,170 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-27 23:54:09,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:54:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-27 23:54:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:54:09,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:09,172 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, 1, 1, 1] [2019-11-27 23:54:09,172 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2019-11-27 23:54:09,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:09,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596415914] [2019-11-27 23:54:09,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:54:09,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596415914] [2019-11-27 23:54:09,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:09,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:09,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438473382] [2019-11-27 23:54:09,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:09,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:09,242 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 5 states. [2019-11-27 23:54:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:09,370 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2019-11-27 23:54:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:54:09,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-27 23:54:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:09,372 INFO L225 Difference]: With dead ends: 139 [2019-11-27 23:54:09,372 INFO L226 Difference]: Without dead ends: 121 [2019-11-27 23:54:09,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-27 23:54:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2019-11-27 23:54:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-27 23:54:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2019-11-27 23:54:09,383 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2019-11-27 23:54:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:09,383 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2019-11-27 23:54:09,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2019-11-27 23:54:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:54:09,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:09,389 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, 1, 1, 1] [2019-11-27 23:54:09,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2019-11-27 23:54:09,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:09,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703543253] [2019-11-27 23:54:09,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:54:09,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703543253] [2019-11-27 23:54:09,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:54:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70144736] [2019-11-27 23:54:09,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:54:09,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:54:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:54:09,435 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 3 states. [2019-11-27 23:54:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:09,480 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2019-11-27 23:54:09,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:09,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 23:54:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:09,481 INFO L225 Difference]: With dead ends: 113 [2019-11-27 23:54:09,481 INFO L226 Difference]: Without dead ends: 111 [2019-11-27 23:54:09,482 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-27 23:54:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-27 23:54:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-27 23:54:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-27 23:54:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2019-11-27 23:54:09,489 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2019-11-27 23:54:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:09,489 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2019-11-27 23:54:09,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:54:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2019-11-27 23:54:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:54:09,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:09,491 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, 1, 1, 1, 1] [2019-11-27 23:54:09,491 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-27 23:54:09,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:09,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797912738] [2019-11-27 23:54:09,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:09,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:54:09,545 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:54:09,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:54:09 BoogieIcfgContainer [2019-11-27 23:54:09,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:54:09,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:54:09,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:54:09,584 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:54:09,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:05" (3/4) ... [2019-11-27 23:54:09,587 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:54:09,646 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:54:09,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:54:09,649 INFO L168 Benchmark]: Toolchain (without parser) took 5187.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:09,649 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:09,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:09,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.04 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-27 23:54:09,651 INFO L168 Benchmark]: Boogie Preprocessor took 48.58 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-27 23:54:09,652 INFO L168 Benchmark]: RCFGBuilder took 684.14 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:09,652 INFO L168 Benchmark]: TraceAbstraction took 3683.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:09,653 INFO L168 Benchmark]: Witness Printer took 62.43 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-27 23:54:09,656 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.04 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. * Boogie Preprocessor took 48.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 684.14 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3683.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.43 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Result: UNSAFE, OverallTime: 3.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 948 SDtfs, 1059 SDslu, 1320 SDs, 0 SdLazy, 648 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 377 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 32423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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...