./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer --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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:27:29,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:27:29,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:27:29,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:27:29,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:27:29,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:27:29,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:27:29,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:27:29,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:27:29,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:27:29,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:27:29,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:27:29,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:27:29,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:27:29,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:27:29,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:27:29,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:27:29,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:27:29,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:27:29,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:27:29,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:27:29,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:27:29,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:27:29,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:27:29,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:27:29,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:27:29,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:27:29,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:27:29,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:27:29,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:27:29,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:27:29,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:27:29,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:27:29,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:27:29,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:27:29,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:27:29,489 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:27:29,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:27:29,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:27:29,500 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:27:29,500 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:27:29,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:27:29,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:27:29,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:27:29,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:27:29,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:27:29,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:27:29,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:27:29,503 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:27:29,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:27:29,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:27:29,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-23 15:27:29,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:27:29,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:27:29,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:27:29,538 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:27:29,538 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:27:29,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 15:27:29,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/data/df499c182/a2b1e7767aaf4aef9cecf3bf630417df/FLAG8e1d95579 [2018-11-23 15:27:29,972 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:27:29,972 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 15:27:29,976 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/data/df499c182/a2b1e7767aaf4aef9cecf3bf630417df/FLAG8e1d95579 [2018-11-23 15:27:29,986 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/data/df499c182/a2b1e7767aaf4aef9cecf3bf630417df [2018-11-23 15:27:29,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:27:29,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:27:29,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:27:29,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:27:29,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:27:29,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:27:29" (1/1) ... [2018-11-23 15:27:29,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72019208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:29, skipping insertion in model container [2018-11-23 15:27:29,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:27:29" (1/1) ... [2018-11-23 15:27:29,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:27:30,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:27:30,150 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:27:30,152 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:27:30,166 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:27:30,177 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:27:30,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30 WrapperNode [2018-11-23 15:27:30,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:27:30,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:27:30,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:27:30,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:27:30,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:27:30,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:27:30,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:27:30,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:27:30,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... [2018-11-23 15:27:30,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:27:30,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:27:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:27:30,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:27:30,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/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 [2018-11-23 15:27:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:27:30,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:27:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:27:30,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:27:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:27:30,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:27:30,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:27:30,446 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:27:30,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:30 BoogieIcfgContainer [2018-11-23 15:27:30,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:27:30,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:27:30,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:27:30,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:27:30,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:27:29" (1/3) ... [2018-11-23 15:27:30,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c0e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:27:30, skipping insertion in model container [2018-11-23 15:27:30,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:30" (2/3) ... [2018-11-23 15:27:30,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c0e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:27:30, skipping insertion in model container [2018-11-23 15:27:30,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:30" (3/3) ... [2018-11-23 15:27:30,452 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 15:27:30,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:27:30,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:27:30,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:27:30,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:27:30,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:27:30,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:27:30,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:27:30,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:27:30,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:27:30,496 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:27:30,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:27:30,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:27:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 15:27:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 15:27:30,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-11-23 15:27:30,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,638 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 15:27:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,670 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-11-23 15:27:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 15:27:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,678 INFO L225 Difference]: With dead ends: 63 [2018-11-23 15:27:30,678 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 15:27:30,680 INFO L631 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 [2018-11-23 15:27:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 15:27:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-23 15:27:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:27:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-11-23 15:27:30,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-11-23 15:27:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,704 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-11-23 15:27:30,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-11-23 15:27:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 15:27:30,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-11-23 15:27:30,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,750 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-11-23 15:27:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,768 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-23 15:27:30,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 15:27:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,769 INFO L225 Difference]: With dead ends: 77 [2018-11-23 15:27:30,769 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 15:27:30,770 INFO L631 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 [2018-11-23 15:27:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 15:27:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 15:27:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 15:27:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-11-23 15:27:30,774 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-11-23 15:27:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,774 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-11-23 15:27:30,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-11-23 15:27:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:27:30,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-11-23 15:27:30,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,802 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-11-23 15:27:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,823 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-23 15:27:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 15:27:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,824 INFO L225 Difference]: With dead ends: 72 [2018-11-23 15:27:30,825 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 15:27:30,825 INFO L631 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 [2018-11-23 15:27:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 15:27:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 15:27:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 15:27:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-11-23 15:27:30,830 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-11-23 15:27:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,831 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-11-23 15:27:30,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-11-23 15:27:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:27:30,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-11-23 15:27:30,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,857 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-11-23 15:27:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,870 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-11-23 15:27:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 15:27:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,871 INFO L225 Difference]: With dead ends: 88 [2018-11-23 15:27:30,871 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 15:27:30,872 INFO L631 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 [2018-11-23 15:27:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 15:27:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-11-23 15:27:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 15:27:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-11-23 15:27:30,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-11-23 15:27:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,876 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-11-23 15:27:30,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-23 15:27:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 15:27:30,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-11-23 15:27:30,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,910 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-11-23 15:27:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,929 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-11-23 15:27:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 15:27:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,930 INFO L225 Difference]: With dead ends: 144 [2018-11-23 15:27:30,930 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 15:27:30,931 INFO L631 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 [2018-11-23 15:27:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 15:27:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 15:27:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 15:27:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-11-23 15:27:30,938 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-11-23 15:27:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,938 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-11-23 15:27:30,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-23 15:27:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:27:30,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-11-23 15:27:30,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:30,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:30,961 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-11-23 15:27:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:30,984 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-11-23 15:27:30,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:30,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 15:27:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:30,985 INFO L225 Difference]: With dead ends: 129 [2018-11-23 15:27:30,985 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 15:27:30,985 INFO L631 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 [2018-11-23 15:27:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 15:27:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 15:27:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 15:27:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-11-23 15:27:30,991 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-11-23 15:27:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:30,991 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-11-23 15:27:30,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-11-23 15:27:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:27:30,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:30,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:30,992 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:30,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-11-23 15:27:30,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,012 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-11-23 15:27:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,022 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-11-23 15:27:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 15:27:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,024 INFO L225 Difference]: With dead ends: 156 [2018-11-23 15:27:31,024 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 15:27:31,024 INFO L631 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 [2018-11-23 15:27:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 15:27:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-11-23 15:27:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 15:27:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-11-23 15:27:31,031 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-11-23 15:27:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,031 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-11-23 15:27:31,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-11-23 15:27:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:27:31,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-11-23 15:27:31,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,069 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-11-23 15:27:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,089 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-11-23 15:27:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 15:27:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,090 INFO L225 Difference]: With dead ends: 272 [2018-11-23 15:27:31,090 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 15:27:31,091 INFO L631 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 [2018-11-23 15:27:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 15:27:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 15:27:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 15:27:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-11-23 15:27:31,100 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-11-23 15:27:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,100 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-11-23 15:27:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-23 15:27:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:27:31,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,102 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-11-23 15:27:31,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,149 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-11-23 15:27:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,162 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-11-23 15:27:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 15:27:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,163 INFO L225 Difference]: With dead ends: 240 [2018-11-23 15:27:31,163 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 15:27:31,164 INFO L631 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 [2018-11-23 15:27:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 15:27:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-23 15:27:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 15:27:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-11-23 15:27:31,172 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-11-23 15:27:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,172 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-11-23 15:27:31,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-11-23 15:27:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:27:31,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,173 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-11-23 15:27:31,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,190 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-11-23 15:27:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,204 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-11-23 15:27:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 15:27:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,206 INFO L225 Difference]: With dead ends: 284 [2018-11-23 15:27:31,206 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 15:27:31,206 INFO L631 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 [2018-11-23 15:27:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 15:27:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-11-23 15:27:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 15:27:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-11-23 15:27:31,214 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-11-23 15:27:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,215 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-11-23 15:27:31,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-11-23 15:27:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:27:31,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,216 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-11-23 15:27:31,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,230 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-11-23 15:27:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,252 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-11-23 15:27:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 15:27:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,253 INFO L225 Difference]: With dead ends: 524 [2018-11-23 15:27:31,253 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 15:27:31,254 INFO L631 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 [2018-11-23 15:27:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 15:27:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 15:27:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 15:27:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-11-23 15:27:31,261 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-11-23 15:27:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,262 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-11-23 15:27:31,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-11-23 15:27:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:27:31,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,263 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,263 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-11-23 15:27:31,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,292 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-11-23 15:27:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,303 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-11-23 15:27:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 15:27:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,304 INFO L225 Difference]: With dead ends: 456 [2018-11-23 15:27:31,304 INFO L226 Difference]: Without dead ends: 314 [2018-11-23 15:27:31,305 INFO L631 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 [2018-11-23 15:27:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-23 15:27:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-11-23 15:27:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 15:27:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-11-23 15:27:31,312 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-11-23 15:27:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,312 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-11-23 15:27:31,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-11-23 15:27:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:27:31,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,313 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-11-23 15:27:31,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,327 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-11-23 15:27:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,345 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-11-23 15:27:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 15:27:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,347 INFO L225 Difference]: With dead ends: 524 [2018-11-23 15:27:31,347 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 15:27:31,347 INFO L631 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 [2018-11-23 15:27:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 15:27:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-11-23 15:27:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 15:27:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-11-23 15:27:31,357 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-11-23 15:27:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,358 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-11-23 15:27:31,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-11-23 15:27:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:27:31,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,359 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-11-23 15:27:31,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,381 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-11-23 15:27:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,405 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-11-23 15:27:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 15:27:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,407 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 15:27:31,407 INFO L226 Difference]: Without dead ends: 586 [2018-11-23 15:27:31,408 INFO L631 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 [2018-11-23 15:27:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-23 15:27:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-11-23 15:27:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 15:27:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-11-23 15:27:31,424 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-11-23 15:27:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,425 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-11-23 15:27:31,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-11-23 15:27:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:27:31,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,426 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-11-23 15:27:31,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,441 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-11-23 15:27:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,468 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-11-23 15:27:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:27:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,470 INFO L225 Difference]: With dead ends: 876 [2018-11-23 15:27:31,470 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 15:27:31,471 INFO L631 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 [2018-11-23 15:27:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 15:27:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 15:27:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 15:27:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-11-23 15:27:31,487 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-11-23 15:27:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,487 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-11-23 15:27:31,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-11-23 15:27:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:27:31,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-11-23 15:27:31,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,505 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-11-23 15:27:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,537 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-11-23 15:27:31,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:27:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,540 INFO L225 Difference]: With dead ends: 970 [2018-11-23 15:27:31,540 INFO L226 Difference]: Without dead ends: 968 [2018-11-23 15:27:31,540 INFO L631 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 [2018-11-23 15:27:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-23 15:27:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-11-23 15:27:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 15:27:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-11-23 15:27:31,562 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-11-23 15:27:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,562 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-11-23 15:27:31,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-11-23 15:27:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:27:31,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:27:31,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:27:31,564 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:27:31,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:27:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-11-23 15:27:31,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:27:31,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:27:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:27:31,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:27:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:27:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:27:31,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:27:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:27:31,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:27:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:27:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:27:31,581 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-11-23 15:27:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:27:31,627 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-11-23 15:27:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:27:31,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:27:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:27:31,627 INFO L225 Difference]: With dead ends: 1992 [2018-11-23 15:27:31,628 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:27:31,630 INFO L631 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 [2018-11-23 15:27:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:27:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:27:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:27:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:27:31,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 15:27:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:27:31,631 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:27:31,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:27:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:27:31,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:27:31,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:27:31,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:27:31,661 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 15:27:31,661 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-23 15:27:31,661 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-23 15:27:31,662 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,663 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-23 15:27:31,663 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-23 15:27:31,663 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-23 15:27:31,663 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-23 15:27:31,663 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,666 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-23 15:27:31,666 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,666 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,666 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-23 15:27:31,666 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,667 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 15:27:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:27:31 BoogieIcfgContainer [2018-11-23 15:27:31,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:27:31,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:27:31,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:27:31,672 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:27:31,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:30" (3/4) ... [2018-11-23 15:27:31,675 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:27:31,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:27:31,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:27:31,683 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 15:27:31,683 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 15:27:31,684 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 15:27:31,722 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85d44b79-0159-431a-9d8f-2e395dc21e52/bin-2019/uautomizer/witness.graphml [2018-11-23 15:27:31,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:27:31,722 INFO L168 Benchmark]: Toolchain (without parser) took 1734.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 958.4 MB in the beginning and 941.3 MB in the end (delta: 17.1 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,723 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:27:31,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.4 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,724 INFO L168 Benchmark]: Boogie Preprocessor took 19.10 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:27:31,724 INFO L168 Benchmark]: RCFGBuilder took 230.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,725 INFO L168 Benchmark]: TraceAbstraction took 1224.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,725 INFO L168 Benchmark]: Witness Printer took 50.33 ms. Allocated memory is still 1.2 GB. Free memory was 948.1 MB in the beginning and 941.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:27:31,727 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.4 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.91 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.10 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 230.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1224.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 200.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. * Witness Printer took 50.33 ms. Allocated memory is still 1.2 GB. Free memory was 948.1 MB in the beginning and 941.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 1.1s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...