/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:09:31,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:09:31,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:09:31,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:09:31,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:09:31,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:09:31,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:09:31,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:09:31,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:09:31,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:09:31,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:09:31,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:09:31,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:09:31,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:09:31,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:09:31,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:09:31,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:09:31,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:09:31,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:09:31,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:09:31,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:09:31,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:09:31,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:09:31,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:09:31,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:09:31,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:09:31,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:09:31,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:09:31,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:09:31,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:09:31,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:09:31,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:09:31,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:09:31,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:09:31,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:09:31,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:09:31,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:09:31,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:09:31,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:09:31,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:09:31,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:09:31,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:09:31,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:09:31,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:09:31,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:09:31,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:09:31,390 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:09:31,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:09:31,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:09:31,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:09:31,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:09:31,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:09:31,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:09:31,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:09:31,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:09:31,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:09:31,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:09:31,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:09:31,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:09:31,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:09:31,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:09:31,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:09:31,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:09:31,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:09:31,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:09:31,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:09:31,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:09:31,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:09:31,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:09:31,731 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:09:31,732 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:09:31,733 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2020-10-16 12:09:31,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ea07ffe3c/98acf0e600994cfb83e74ad6085635bf/FLAG8429e8a96 [2020-10-16 12:09:32,405 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:09:32,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2020-10-16 12:09:32,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ea07ffe3c/98acf0e600994cfb83e74ad6085635bf/FLAG8429e8a96 [2020-10-16 12:09:32,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ea07ffe3c/98acf0e600994cfb83e74ad6085635bf [2020-10-16 12:09:32,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:09:32,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:09:32,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:09:32,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:09:32,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:09:32,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:09:32" (1/1) ... [2020-10-16 12:09:32,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106f3b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:32, skipping insertion in model container [2020-10-16 12:09:32,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:09:32" (1/1) ... [2020-10-16 12:09:32,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:09:32,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:09:33,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:09:33,228 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:09:33,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:09:33,390 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:09:33,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33 WrapperNode [2020-10-16 12:09:33,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:09:33,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:09:33,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:09:33,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:09:33,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:09:33,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:09:33,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:09:33,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:09:33,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... [2020-10-16 12:09:33,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:09:33,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:09:33,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:09:33,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:09:33,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:09:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:09:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:09:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:09:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:09:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:09:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:09:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:09:33,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:09:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:09:33,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:09:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:09:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:09:33,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:09:33,595 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:09:35,746 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:09:35,746 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:09:35,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:09:35 BoogieIcfgContainer [2020-10-16 12:09:35,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:09:35,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:09:35,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:09:35,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:09:35,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:09:32" (1/3) ... [2020-10-16 12:09:35,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583eaaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:09:35, skipping insertion in model container [2020-10-16 12:09:35,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:33" (2/3) ... [2020-10-16 12:09:35,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583eaaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:09:35, skipping insertion in model container [2020-10-16 12:09:35,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:09:35" (3/3) ... [2020-10-16 12:09:35,759 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2020-10-16 12:09:35,772 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:09:35,772 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:09:35,780 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:09:35,781 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:09:35,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,828 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,833 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,833 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:35,843 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:09:35,858 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:09:35,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:09:35,880 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:09:35,880 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:09:35,881 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:09:35,881 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:09:35,881 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:09:35,881 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:09:35,881 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:09:35,896 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:09:35,897 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:35,899 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:35,901 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:35,946 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 12:09:35,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:09:35,951 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:09:35,954 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-16 12:09:36,266 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:09:36,789 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:09:36,941 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:09:37,509 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:09:40,042 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:09:40,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:09:40,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:40,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:09:40,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:41,101 WARN L193 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 12:09:41,469 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 12:09:43,078 WARN L193 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 12:09:43,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:09:43,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:43,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:09:43,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:44,437 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2020-10-16 12:09:44,471 INFO L132 LiptonReduction]: Checked pairs total: 4070 [2020-10-16 12:09:44,471 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 12:09:44,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:09:44,559 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-16 12:09:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-16 12:09:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 12:09:44,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:44,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 12:09:44,572 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:44,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-16 12:09:44,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:44,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456689908] [2020-10-16 12:09:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:44,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456689908] [2020-10-16 12:09:44,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:44,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:44,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146275567] [2020-10-16 12:09:44,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:44,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:44,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:44,920 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-16 12:09:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,078 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-16 12:09:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:45,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 12:09:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,103 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:09:45,103 INFO L226 Difference]: Without dead ends: 452 [2020-10-16 12:09:45,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-16 12:09:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-16 12:09:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-16 12:09:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-16 12:09:45,197 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-16 12:09:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:45,197 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-16 12:09:45,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-16 12:09:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:09:45,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:45,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:45,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:09:45,200 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-16 12:09:45,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:45,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501646090] [2020-10-16 12:09:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:45,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501646090] [2020-10-16 12:09:45,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:45,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:45,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095782281] [2020-10-16 12:09:45,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:45,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,342 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-16 12:09:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,363 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-10-16 12:09:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:45,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:09:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,369 INFO L225 Difference]: With dead ends: 442 [2020-10-16 12:09:45,370 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 12:09:45,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 12:09:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-16 12:09:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-16 12:09:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-10-16 12:09:45,400 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9 [2020-10-16 12:09:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:45,401 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-10-16 12:09:45,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-10-16 12:09:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:09:45,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:45,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:45,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:09:45,404 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-16 12:09:45,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:45,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800001376] [2020-10-16 12:09:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:45,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800001376] [2020-10-16 12:09:45,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:45,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:45,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112920558] [2020-10-16 12:09:45,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:45,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,501 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-10-16 12:09:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,536 INFO L93 Difference]: Finished difference Result 439 states and 1313 transitions. [2020-10-16 12:09:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:45,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:09:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,542 INFO L225 Difference]: With dead ends: 439 [2020-10-16 12:09:45,542 INFO L226 Difference]: Without dead ends: 439 [2020-10-16 12:09:45,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-16 12:09:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-16 12:09:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-16 12:09:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions. [2020-10-16 12:09:45,565 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10 [2020-10-16 12:09:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:45,565 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions. [2020-10-16 12:09:45,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions. [2020-10-16 12:09:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:09:45,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:45,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:45,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:09:45,568 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -872477858, now seen corresponding path program 1 times [2020-10-16 12:09:45,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:45,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60041183] [2020-10-16 12:09:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:45,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60041183] [2020-10-16 12:09:45,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:45,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:09:45,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255399617] [2020-10-16 12:09:45,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:45,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,634 INFO L87 Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 3 states. [2020-10-16 12:09:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,657 INFO L93 Difference]: Finished difference Result 622 states and 1777 transitions. [2020-10-16 12:09:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:45,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:09:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,662 INFO L225 Difference]: With dead ends: 622 [2020-10-16 12:09:45,662 INFO L226 Difference]: Without dead ends: 469 [2020-10-16 12:09:45,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-10-16 12:09:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 424. [2020-10-16 12:09:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-16 12:09:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1210 transitions. [2020-10-16 12:09:45,680 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1210 transitions. Word has length 11 [2020-10-16 12:09:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:45,680 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1210 transitions. [2020-10-16 12:09:45,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1210 transitions. [2020-10-16 12:09:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:09:45,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:45,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:45,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:09:45,683 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1529992242, now seen corresponding path program 1 times [2020-10-16 12:09:45,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:45,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074348831] [2020-10-16 12:09:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:45,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074348831] [2020-10-16 12:09:45,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:45,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:09:45,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864036470] [2020-10-16 12:09:45,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:45,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:45,756 INFO L87 Difference]: Start difference. First operand 424 states and 1210 transitions. Second operand 4 states. [2020-10-16 12:09:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,828 INFO L93 Difference]: Finished difference Result 412 states and 1169 transitions. [2020-10-16 12:09:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:45,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:09:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,833 INFO L225 Difference]: With dead ends: 412 [2020-10-16 12:09:45,833 INFO L226 Difference]: Without dead ends: 412 [2020-10-16 12:09:45,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-10-16 12:09:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2020-10-16 12:09:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-10-16 12:09:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1169 transitions. [2020-10-16 12:09:45,850 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1169 transitions. Word has length 11 [2020-10-16 12:09:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:45,850 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 1169 transitions. [2020-10-16 12:09:45,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1169 transitions. [2020-10-16 12:09:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:09:45,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:45,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:45,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:09:45,854 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times [2020-10-16 12:09:45,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:45,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009892775] [2020-10-16 12:09:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:45,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009892775] [2020-10-16 12:09:45,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:45,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:45,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096684427] [2020-10-16 12:09:45,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:45,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,955 INFO L87 Difference]: Start difference. First operand 412 states and 1169 transitions. Second operand 3 states. [2020-10-16 12:09:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:45,987 INFO L93 Difference]: Finished difference Result 409 states and 1158 transitions. [2020-10-16 12:09:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:45,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:09:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:45,992 INFO L225 Difference]: With dead ends: 409 [2020-10-16 12:09:45,992 INFO L226 Difference]: Without dead ends: 409 [2020-10-16 12:09:45,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2020-10-16 12:09:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2020-10-16 12:09:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-16 12:09:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1158 transitions. [2020-10-16 12:09:46,005 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1158 transitions. Word has length 11 [2020-10-16 12:09:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:46,006 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1158 transitions. [2020-10-16 12:09:46,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1158 transitions. [2020-10-16 12:09:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:46,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:46,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:46,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:09:46,008 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 185118520, now seen corresponding path program 1 times [2020-10-16 12:09:46,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:46,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194495447] [2020-10-16 12:09:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:46,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194495447] [2020-10-16 12:09:46,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:46,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:46,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446149551] [2020-10-16 12:09:46,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:46,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:46,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:46,131 INFO L87 Difference]: Start difference. First operand 409 states and 1158 transitions. Second operand 5 states. [2020-10-16 12:09:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:46,257 INFO L93 Difference]: Finished difference Result 423 states and 1182 transitions. [2020-10-16 12:09:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:46,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:09:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:46,263 INFO L225 Difference]: With dead ends: 423 [2020-10-16 12:09:46,263 INFO L226 Difference]: Without dead ends: 423 [2020-10-16 12:09:46,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-16 12:09:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2020-10-16 12:09:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-16 12:09:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1182 transitions. [2020-10-16 12:09:46,280 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1182 transitions. Word has length 12 [2020-10-16 12:09:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:46,281 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1182 transitions. [2020-10-16 12:09:46,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1182 transitions. [2020-10-16 12:09:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:46,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:46,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:46,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:09:46,283 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times [2020-10-16 12:09:46,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:46,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429298871] [2020-10-16 12:09:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:46,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429298871] [2020-10-16 12:09:46,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:46,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:09:46,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592972580] [2020-10-16 12:09:46,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:46,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:46,370 INFO L87 Difference]: Start difference. First operand 423 states and 1182 transitions. Second operand 4 states. [2020-10-16 12:09:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:46,443 INFO L93 Difference]: Finished difference Result 431 states and 1207 transitions. [2020-10-16 12:09:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:46,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:09:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:46,448 INFO L225 Difference]: With dead ends: 431 [2020-10-16 12:09:46,448 INFO L226 Difference]: Without dead ends: 431 [2020-10-16 12:09:46,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-16 12:09:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2020-10-16 12:09:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-16 12:09:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1193 transitions. [2020-10-16 12:09:46,464 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1193 transitions. Word has length 12 [2020-10-16 12:09:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:46,464 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1193 transitions. [2020-10-16 12:09:46,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1193 transitions. [2020-10-16 12:09:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:46,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:46,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:46,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:09:46,466 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times [2020-10-16 12:09:46,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:46,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394028705] [2020-10-16 12:09:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:46,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394028705] [2020-10-16 12:09:46,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:46,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:46,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923446712] [2020-10-16 12:09:46,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:46,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:46,573 INFO L87 Difference]: Start difference. First operand 427 states and 1193 transitions. Second operand 5 states. [2020-10-16 12:09:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:46,649 INFO L93 Difference]: Finished difference Result 422 states and 1177 transitions. [2020-10-16 12:09:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:46,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:09:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:46,654 INFO L225 Difference]: With dead ends: 422 [2020-10-16 12:09:46,655 INFO L226 Difference]: Without dead ends: 422 [2020-10-16 12:09:46,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-16 12:09:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2020-10-16 12:09:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-16 12:09:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1152 transitions. [2020-10-16 12:09:46,671 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1152 transitions. Word has length 12 [2020-10-16 12:09:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:46,672 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1152 transitions. [2020-10-16 12:09:46,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1152 transitions. [2020-10-16 12:09:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:09:46,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:46,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:46,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:09:46,674 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times [2020-10-16 12:09:46,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:46,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881443972] [2020-10-16 12:09:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:46,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881443972] [2020-10-16 12:09:46,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:46,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:09:46,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450750954] [2020-10-16 12:09:46,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:09:46,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:09:46,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:46,858 INFO L87 Difference]: Start difference. First operand 414 states and 1152 transitions. Second operand 6 states. [2020-10-16 12:09:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:46,951 INFO L93 Difference]: Finished difference Result 410 states and 1138 transitions. [2020-10-16 12:09:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:46,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:09:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:46,959 INFO L225 Difference]: With dead ends: 410 [2020-10-16 12:09:46,959 INFO L226 Difference]: Without dead ends: 410 [2020-10-16 12:09:46,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:09:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-16 12:09:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394. [2020-10-16 12:09:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-16 12:09:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1106 transitions. [2020-10-16 12:09:46,972 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1106 transitions. Word has length 13 [2020-10-16 12:09:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:46,973 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 1106 transitions. [2020-10-16 12:09:46,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:09:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1106 transitions. [2020-10-16 12:09:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:09:46,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:46,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:46,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:09:46,975 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1443705354, now seen corresponding path program 1 times [2020-10-16 12:09:46,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:46,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651585695] [2020-10-16 12:09:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:47,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651585695] [2020-10-16 12:09:47,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:47,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:47,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757557655] [2020-10-16 12:09:47,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:47,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:47,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:47,051 INFO L87 Difference]: Start difference. First operand 394 states and 1106 transitions. Second operand 5 states. [2020-10-16 12:09:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:47,159 INFO L93 Difference]: Finished difference Result 470 states and 1303 transitions. [2020-10-16 12:09:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:09:47,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:09:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:47,164 INFO L225 Difference]: With dead ends: 470 [2020-10-16 12:09:47,164 INFO L226 Difference]: Without dead ends: 446 [2020-10-16 12:09:47,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:09:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-10-16 12:09:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2020-10-16 12:09:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:09:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1226 transitions. [2020-10-16 12:09:47,178 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1226 transitions. Word has length 13 [2020-10-16 12:09:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:47,179 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1226 transitions. [2020-10-16 12:09:47,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1226 transitions. [2020-10-16 12:09:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:09:47,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:47,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:47,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:09:47,181 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:47,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times [2020-10-16 12:09:47,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:47,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081867772] [2020-10-16 12:09:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:47,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081867772] [2020-10-16 12:09:47,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:47,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:47,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034381474] [2020-10-16 12:09:47,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:47,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:47,267 INFO L87 Difference]: Start difference. First operand 440 states and 1226 transitions. Second operand 4 states. [2020-10-16 12:09:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:47,306 INFO L93 Difference]: Finished difference Result 432 states and 1062 transitions. [2020-10-16 12:09:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:09:47,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:09:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:47,309 INFO L225 Difference]: With dead ends: 432 [2020-10-16 12:09:47,310 INFO L226 Difference]: Without dead ends: 316 [2020-10-16 12:09:47,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-10-16 12:09:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2020-10-16 12:09:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-10-16 12:09:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 754 transitions. [2020-10-16 12:09:47,320 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 754 transitions. Word has length 14 [2020-10-16 12:09:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:47,320 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 754 transitions. [2020-10-16 12:09:47,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 754 transitions. [2020-10-16 12:09:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:09:47,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:47,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:47,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:09:47,322 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times [2020-10-16 12:09:47,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:47,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789246374] [2020-10-16 12:09:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:47,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789246374] [2020-10-16 12:09:47,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:47,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:09:47,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836017364] [2020-10-16 12:09:47,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:47,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:47,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:47,411 INFO L87 Difference]: Start difference. First operand 316 states and 754 transitions. Second operand 5 states. [2020-10-16 12:09:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:47,469 INFO L93 Difference]: Finished difference Result 261 states and 573 transitions. [2020-10-16 12:09:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:09:47,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:09:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:47,472 INFO L225 Difference]: With dead ends: 261 [2020-10-16 12:09:47,472 INFO L226 Difference]: Without dead ends: 201 [2020-10-16 12:09:47,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-16 12:09:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 185. [2020-10-16 12:09:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-16 12:09:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 393 transitions. [2020-10-16 12:09:47,480 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 393 transitions. Word has length 15 [2020-10-16 12:09:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:47,481 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 393 transitions. [2020-10-16 12:09:47,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 393 transitions. [2020-10-16 12:09:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:09:47,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:47,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:47,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:09:47,482 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times [2020-10-16 12:09:47,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:47,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192542856] [2020-10-16 12:09:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:47,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192542856] [2020-10-16 12:09:47,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:47,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:09:47,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845340581] [2020-10-16 12:09:47,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:09:47,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:09:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:47,607 INFO L87 Difference]: Start difference. First operand 185 states and 393 transitions. Second operand 6 states. [2020-10-16 12:09:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:47,676 INFO L93 Difference]: Finished difference Result 167 states and 356 transitions. [2020-10-16 12:09:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:09:47,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:09:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:47,679 INFO L225 Difference]: With dead ends: 167 [2020-10-16 12:09:47,679 INFO L226 Difference]: Without dead ends: 117 [2020-10-16 12:09:47,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:09:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-16 12:09:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-10-16 12:09:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-16 12:09:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions. [2020-10-16 12:09:47,684 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17 [2020-10-16 12:09:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:47,685 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 240 transitions. [2020-10-16 12:09:47,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:09:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions. [2020-10-16 12:09:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:47,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:47,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:47,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:09:47,686 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times [2020-10-16 12:09:47,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:47,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723820656] [2020-10-16 12:09:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:47,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723820656] [2020-10-16 12:09:47,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:47,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:09:47,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866191374] [2020-10-16 12:09:47,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:09:47,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:09:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:47,893 INFO L87 Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 6 states. [2020-10-16 12:09:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:48,054 INFO L93 Difference]: Finished difference Result 145 states and 301 transitions. [2020-10-16 12:09:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:09:48,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:09:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:48,057 INFO L225 Difference]: With dead ends: 145 [2020-10-16 12:09:48,057 INFO L226 Difference]: Without dead ends: 115 [2020-10-16 12:09:48,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:09:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-16 12:09:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-16 12:09:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-16 12:09:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 192 transitions. [2020-10-16 12:09:48,061 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 192 transitions. Word has length 20 [2020-10-16 12:09:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:48,061 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 192 transitions. [2020-10-16 12:09:48,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:09:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2020-10-16 12:09:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:48,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:48,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:48,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:09:48,063 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:48,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times [2020-10-16 12:09:48,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:48,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125668723] [2020-10-16 12:09:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:48,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125668723] [2020-10-16 12:09:48,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:48,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:09:48,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895742256] [2020-10-16 12:09:48,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:09:48,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:09:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:09:48,318 INFO L87 Difference]: Start difference. First operand 97 states and 192 transitions. Second operand 8 states. [2020-10-16 12:09:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:48,607 INFO L93 Difference]: Finished difference Result 152 states and 292 transitions. [2020-10-16 12:09:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:09:48,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-16 12:09:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:48,609 INFO L225 Difference]: With dead ends: 152 [2020-10-16 12:09:48,609 INFO L226 Difference]: Without dead ends: 106 [2020-10-16 12:09:48,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:09:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-16 12:09:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2020-10-16 12:09:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-16 12:09:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions. [2020-10-16 12:09:48,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20 [2020-10-16 12:09:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:48,614 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 144 transitions. [2020-10-16 12:09:48,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:09:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2020-10-16 12:09:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:48,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:48,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:48,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:09:48,615 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:48,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times [2020-10-16 12:09:48,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:48,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815098868] [2020-10-16 12:09:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:09:48,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:09:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:09:48,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:09:48,736 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:09:48,736 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:09:48,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:09:48,738 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:09:48,753 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In-226429170 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In-226429170 256) 0)) (.cse8 (= 0 (mod ~y$w_buff0_used~0_In-226429170 256))) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-226429170 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and (= ~y$w_buff1_used~0_In-226429170 ~y$w_buff1_used~0_Out-226429170) .cse0) (and (= ~y$w_buff1_used~0_Out-226429170 0) .cse1 .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-226429170 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-226429170|) (= ~y$r_buff1_thd0~0_Out-226429170 ~y$r_buff1_thd0~0_In-226429170) (= ~y$r_buff0_thd0~0_In-226429170 ~y$r_buff0_thd0~0_Out-226429170) (or (and (= ~y$w_buff0_used~0_Out-226429170 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff0_used~0_In-226429170 ~y$w_buff0_used~0_Out-226429170))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-226429170 0)) (or (and (= ~y~0_Out-226429170 ~y$w_buff0~0_In-226429170) .cse3 .cse4) (and .cse5 (or (and .cse1 (= ~y~0_Out-226429170 ~y$w_buff1~0_In-226429170) .cse2) (and (= ~y~0_Out-226429170 ~y~0_In-226429170) .cse0))))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-226429170|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-226429170, ~y$w_buff1~0=~y$w_buff1~0_In-226429170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-226429170, ~y$w_buff0~0=~y$w_buff0~0_In-226429170, ~y~0=~y~0_In-226429170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-226429170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-226429170} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-226429170|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-226429170, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-226429170|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-226429170|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-226429170|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-226429170|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-226429170|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-226429170|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-226429170, ~y$w_buff1~0=~y$w_buff1~0_In-226429170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-226429170, ~y$w_buff0~0=~y$w_buff0~0_In-226429170, ~y~0=~y~0_Out-226429170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-226429170, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-226429170} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:09:48,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,760 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,761 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:48,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:48,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:09:48 BasicIcfg [2020-10-16 12:09:48,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:09:48,853 INFO L168 Benchmark]: Toolchain (without parser) took 16203.91 ms. Allocated memory was 142.6 MB in the beginning and 383.8 MB in the end (delta: 241.2 MB). Free memory was 103.2 MB in the beginning and 285.3 MB in the end (delta: -182.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,854 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 142.6 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:09:48,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.30 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 103.0 MB in the beginning and 158.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,860 INFO L168 Benchmark]: Boogie Preprocessor took 65.44 ms. Allocated memory is still 204.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,860 INFO L168 Benchmark]: RCFGBuilder took 2224.94 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 153.5 MB in the beginning and 155.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,861 INFO L168 Benchmark]: TraceAbstraction took 13100.94 ms. Allocated memory was 243.8 MB in the beginning and 383.8 MB in the end (delta: 140.0 MB). Free memory was 155.3 MB in the beginning and 285.3 MB in the end (delta: -130.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:48,867 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.43 ms. Allocated memory is still 142.6 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.30 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 103.0 MB in the beginning and 158.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.58 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.44 ms. Allocated memory is still 204.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2224.94 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 153.5 MB in the beginning and 155.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13100.94 ms. Allocated memory was 243.8 MB in the beginning and 383.8 MB in the end (delta: 140.0 MB). Free memory was 155.3 MB in the beginning and 285.3 MB in the end (delta: -130.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 803 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 41 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4070 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2189; [L803] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2190; [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L806] 0 pthread_t t2191; [L807] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 318 SDtfs, 345 SDslu, 511 SDs, 0 SdLazy, 361 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 146 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 25302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...