/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/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:02:13,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:02:13,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:02:13,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:02:13,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:02:13,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:02:13,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:02:13,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:02:13,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:02:13,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:02:13,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:02:13,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:02:13,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:02:13,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:02:13,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:02:13,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:02:13,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:02:13,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:02:13,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:02:13,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:02:13,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:02:13,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:02:13,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:02:13,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:02:13,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:02:13,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:02:13,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:02:13,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:02:13,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:02:13,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:02:13,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:02:13,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:02:13,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:02:13,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:02:13,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:02:13,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:02:13,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:02:13,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:02:13,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:02:13,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:02:13,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:02:13,746 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:02:13,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:02:13,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:02:13,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:02:13,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:02:13,797 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:02:13,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:02:13,798 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:02:13,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:02:13,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:02:13,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:02:13,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:02:13,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:02:13,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:02:13,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:02:13,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:02:13,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:02:13,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:02:13,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:02:13,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:02:13,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:02:13,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:02:13,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:02:13,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:02:13,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:02:14,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:02:14,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:02:14,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:02:14,167 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:02:14,168 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:02:14,168 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2020-10-16 12:02:14,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67de01b24/8180bc47733d49d783ab89c5ae353872/FLAGe38971211 [2020-10-16 12:02:14,812 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:02:14,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2020-10-16 12:02:14,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67de01b24/8180bc47733d49d783ab89c5ae353872/FLAGe38971211 [2020-10-16 12:02:15,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67de01b24/8180bc47733d49d783ab89c5ae353872 [2020-10-16 12:02:15,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:02:15,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:02:15,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:15,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:02:15,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:02:15,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:15,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8589d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15, skipping insertion in model container [2020-10-16 12:02:15,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:15,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:02:15,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:02:15,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:15,752 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:02:15,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:02:15,935 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:02:15,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15 WrapperNode [2020-10-16 12:02:15,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:02:15,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:15,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:02:15,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:02:15,947 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:02:15" (1/1) ... [2020-10-16 12:02:15,969 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:02:15" (1/1) ... [2020-10-16 12:02:16,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:02:16,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:02:16,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:02:16,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:02:16,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (1/1) ... [2020-10-16 12:02:16,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:02:16,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:02:16,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:02:16,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:02:16,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (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:02:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:02:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:02:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:02:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:02:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:02:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:02:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:02:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:02:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:02:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:02:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:02:16,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:02:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:02:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:02:16,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:02:16,133 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:02:18,396 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:02:18,396 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:02:18,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:18 BoogieIcfgContainer [2020-10-16 12:02:18,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:02:18,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:02:18,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:02:18,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:02:18,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:15" (1/3) ... [2020-10-16 12:02:18,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b8f168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:18, skipping insertion in model container [2020-10-16 12:02:18,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:15" (2/3) ... [2020-10-16 12:02:18,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b8f168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:18, skipping insertion in model container [2020-10-16 12:02:18,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:18" (3/3) ... [2020-10-16 12:02:18,407 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2020-10-16 12:02:18,419 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:02:18,420 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:02:18,428 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:02:18,429 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:02:18,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,479 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:02:18,495 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:02:18,509 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:02:18,531 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:02:18,531 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:02:18,531 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:02:18,532 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:02:18,532 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:02:18,532 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:02:18,532 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:02:18,532 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:02:18,546 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:02:18,547 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 12:02:18,550 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 12:02:18,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-16 12:02:18,604 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-16 12:02:18,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:02:18,609 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 12:02:18,613 INFO L117 LiptonReduction]: Number of co-enabled transitions 2806 [2020-10-16 12:02:20,444 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:02:20,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:02:20,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:20,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:02:20,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:02:22,038 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 12:02:22,752 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:02:22,905 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:02:24,223 WARN L193 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 129 [2020-10-16 12:02:24,660 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:02:25,304 WARN L193 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2020-10-16 12:02:25,628 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-16 12:02:26,981 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-16 12:02:27,458 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:02:28,129 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 12:02:28,482 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:02:28,824 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 12:02:28,969 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 12:02:28,979 INFO L132 LiptonReduction]: Checked pairs total: 7774 [2020-10-16 12:02:28,979 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 12:02:28,985 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-16 12:02:29,329 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-16 12:02:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-16 12:02:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:02:29,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:29,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:02:29,340 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:29,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1157549879, now seen corresponding path program 1 times [2020-10-16 12:02:29,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:29,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231194608] [2020-10-16 12:02:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:29,702 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:02:29,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231194608] [2020-10-16 12:02:29,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:29,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:29,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427160003] [2020-10-16 12:02:29,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:29,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:29,729 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-16 12:02:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:29,947 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-16 12:02:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:29,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:02:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:30,014 INFO L225 Difference]: With dead ends: 4062 [2020-10-16 12:02:30,014 INFO L226 Difference]: Without dead ends: 3312 [2020-10-16 12:02:30,015 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:02:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-16 12:02:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-16 12:02:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-16 12:02:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-16 12:02:30,273 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-10-16 12:02:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:30,274 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-16 12:02:30,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-16 12:02:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:02:30,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:30,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:30,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:02:30,282 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2037466768, now seen corresponding path program 1 times [2020-10-16 12:02:30,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:30,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170103909] [2020-10-16 12:02:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:30,465 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:02:30,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170103909] [2020-10-16 12:02:30,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:30,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:30,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701141145] [2020-10-16 12:02:30,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:30,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:30,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:30,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:30,469 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-16 12:02:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:30,524 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-16 12:02:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:30,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:02:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:30,629 INFO L225 Difference]: With dead ends: 3062 [2020-10-16 12:02:30,629 INFO L226 Difference]: Without dead ends: 3062 [2020-10-16 12:02:30,631 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:02:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-16 12:02:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-16 12:02:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-16 12:02:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-16 12:02:30,742 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11 [2020-10-16 12:02:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:30,749 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-16 12:02:30,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-16 12:02:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:02:30,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:30,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:30,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:02:30,754 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash -499637443, now seen corresponding path program 1 times [2020-10-16 12:02:30,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:30,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149321623] [2020-10-16 12:02:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:30,825 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:02:30,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149321623] [2020-10-16 12:02:30,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:30,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:02:30,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199836376] [2020-10-16 12:02:30,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:02:30,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:02:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:02:30,827 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-16 12:02:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:30,907 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-16 12:02:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:02:30,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:02:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:30,933 INFO L225 Difference]: With dead ends: 3022 [2020-10-16 12:02:30,933 INFO L226 Difference]: Without dead ends: 3022 [2020-10-16 12:02:30,934 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:02:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-16 12:02:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-16 12:02:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-16 12:02:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-16 12:02:31,045 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-16 12:02:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:31,045 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-16 12:02:31,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:02:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-16 12:02:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:02:31,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:31,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:31,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:02:31,049 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash 829254657, now seen corresponding path program 1 times [2020-10-16 12:02:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:31,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577066977] [2020-10-16 12:02:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:31,149 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:02:31,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577066977] [2020-10-16 12:02:31,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:31,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:02:31,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506379040] [2020-10-16 12:02:31,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:31,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:31,152 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-16 12:02:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:31,252 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions. [2020-10-16 12:02:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:31,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:02:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:31,280 INFO L225 Difference]: With dead ends: 3230 [2020-10-16 12:02:31,280 INFO L226 Difference]: Without dead ends: 3230 [2020-10-16 12:02:31,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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:02:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2020-10-16 12:02:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2020-10-16 12:02:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-10-16 12:02:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions. [2020-10-16 12:02:31,399 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14 [2020-10-16 12:02:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:31,400 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions. [2020-10-16 12:02:31,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions. [2020-10-16 12:02:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:02:31,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:31,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:31,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:02:31,404 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 243137123, now seen corresponding path program 1 times [2020-10-16 12:02:31,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:31,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965734373] [2020-10-16 12:02:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:31,477 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:02:31,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965734373] [2020-10-16 12:02:31,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:31,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:31,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202329805] [2020-10-16 12:02:31,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:31,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:31,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:31,479 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states. [2020-10-16 12:02:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:31,580 INFO L93 Difference]: Finished difference Result 3240 states and 12508 transitions. [2020-10-16 12:02:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:31,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:02:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:31,598 INFO L225 Difference]: With dead ends: 3240 [2020-10-16 12:02:31,598 INFO L226 Difference]: Without dead ends: 3240 [2020-10-16 12:02:31,598 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:02:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2020-10-16 12:02:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3170. [2020-10-16 12:02:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2020-10-16 12:02:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions. [2020-10-16 12:02:31,786 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 15 [2020-10-16 12:02:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:31,787 INFO L481 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions. [2020-10-16 12:02:31,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions. [2020-10-16 12:02:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:02:31,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:31,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:31,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:02:31,792 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:31,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1914537573, now seen corresponding path program 1 times [2020-10-16 12:02:31,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:31,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972991573] [2020-10-16 12:02:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:31,921 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:02:31,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972991573] [2020-10-16 12:02:31,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:31,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:31,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662436435] [2020-10-16 12:02:31,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:31,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:31,925 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 6 states. [2020-10-16 12:02:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:32,114 INFO L93 Difference]: Finished difference Result 3444 states and 13370 transitions. [2020-10-16 12:02:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:32,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:02:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:32,132 INFO L225 Difference]: With dead ends: 3444 [2020-10-16 12:02:32,132 INFO L226 Difference]: Without dead ends: 3444 [2020-10-16 12:02:32,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2020-10-16 12:02:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2020-10-16 12:02:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2020-10-16 12:02:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 13370 transitions. [2020-10-16 12:02:32,252 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 13370 transitions. Word has length 16 [2020-10-16 12:02:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:32,253 INFO L481 AbstractCegarLoop]: Abstraction has 3444 states and 13370 transitions. [2020-10-16 12:02:32,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 13370 transitions. [2020-10-16 12:02:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:02:32,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:32,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:32,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:02:32,261 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1052683873, now seen corresponding path program 2 times [2020-10-16 12:02:32,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:32,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253114445] [2020-10-16 12:02:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:32,411 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:02:32,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253114445] [2020-10-16 12:02:32,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:32,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:32,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188669506] [2020-10-16 12:02:32,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:32,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:32,414 INFO L87 Difference]: Start difference. First operand 3444 states and 13370 transitions. Second operand 6 states. [2020-10-16 12:02:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:32,598 INFO L93 Difference]: Finished difference Result 3974 states and 15357 transitions. [2020-10-16 12:02:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:32,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:02:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:32,617 INFO L225 Difference]: With dead ends: 3974 [2020-10-16 12:02:32,617 INFO L226 Difference]: Without dead ends: 3974 [2020-10-16 12:02:32,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2020-10-16 12:02:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3682. [2020-10-16 12:02:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3682 states. [2020-10-16 12:02:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 14153 transitions. [2020-10-16 12:02:32,739 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 14153 transitions. Word has length 16 [2020-10-16 12:02:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:32,740 INFO L481 AbstractCegarLoop]: Abstraction has 3682 states and 14153 transitions. [2020-10-16 12:02:32,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 14153 transitions. [2020-10-16 12:02:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:02:32,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:32,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:32,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:02:32,746 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash -473924990, now seen corresponding path program 1 times [2020-10-16 12:02:32,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:32,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351846772] [2020-10-16 12:02:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:32,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:02:32,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351846772] [2020-10-16 12:02:32,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:32,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:32,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854072317] [2020-10-16 12:02:32,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:32,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:32,892 INFO L87 Difference]: Start difference. First operand 3682 states and 14153 transitions. Second operand 4 states. [2020-10-16 12:02:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:32,979 INFO L93 Difference]: Finished difference Result 3736 states and 13108 transitions. [2020-10-16 12:02:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:32,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:02:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:32,994 INFO L225 Difference]: With dead ends: 3736 [2020-10-16 12:02:32,995 INFO L226 Difference]: Without dead ends: 2758 [2020-10-16 12:02:32,997 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:02:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2020-10-16 12:02:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2020-10-16 12:02:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2020-10-16 12:02:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 9533 transitions. [2020-10-16 12:02:33,089 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 9533 transitions. Word has length 16 [2020-10-16 12:02:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:33,090 INFO L481 AbstractCegarLoop]: Abstraction has 2758 states and 9533 transitions. [2020-10-16 12:02:33,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 9533 transitions. [2020-10-16 12:02:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:02:33,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:33,095 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:02:33,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:02:33,096 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash 559313562, now seen corresponding path program 1 times [2020-10-16 12:02:33,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:33,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379548317] [2020-10-16 12:02:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:33,214 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:02:33,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379548317] [2020-10-16 12:02:33,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:33,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:02:33,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791086706] [2020-10-16 12:02:33,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:33,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:33,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:33,218 INFO L87 Difference]: Start difference. First operand 2758 states and 9533 transitions. Second operand 5 states. [2020-10-16 12:02:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:33,293 INFO L93 Difference]: Finished difference Result 2328 states and 7484 transitions. [2020-10-16 12:02:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:02:33,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:02:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:33,303 INFO L225 Difference]: With dead ends: 2328 [2020-10-16 12:02:33,304 INFO L226 Difference]: Without dead ends: 1758 [2020-10-16 12:02:33,304 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:02:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2020-10-16 12:02:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1570. [2020-10-16 12:02:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-10-16 12:02:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 4883 transitions. [2020-10-16 12:02:33,435 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 4883 transitions. Word has length 17 [2020-10-16 12:02:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:33,435 INFO L481 AbstractCegarLoop]: Abstraction has 1570 states and 4883 transitions. [2020-10-16 12:02:33,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 4883 transitions. [2020-10-16 12:02:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:02:33,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:33,440 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:02:33,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:02:33,444 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash -419348928, now seen corresponding path program 1 times [2020-10-16 12:02:33,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:33,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326900901] [2020-10-16 12:02:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:33,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:02:33,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326900901] [2020-10-16 12:02:33,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:33,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:02:33,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290983744] [2020-10-16 12:02:33,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:02:33,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:02:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:33,607 INFO L87 Difference]: Start difference. First operand 1570 states and 4883 transitions. Second operand 6 states. [2020-10-16 12:02:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:33,684 INFO L93 Difference]: Finished difference Result 1383 states and 4281 transitions. [2020-10-16 12:02:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:02:33,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:02:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:33,691 INFO L225 Difference]: With dead ends: 1383 [2020-10-16 12:02:33,691 INFO L226 Difference]: Without dead ends: 1229 [2020-10-16 12:02:33,692 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:02:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-10-16 12:02:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1133. [2020-10-16 12:02:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-16 12:02:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3572 transitions. [2020-10-16 12:02:33,727 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3572 transitions. Word has length 20 [2020-10-16 12:02:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:33,728 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 3572 transitions. [2020-10-16 12:02:33,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:02:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3572 transitions. [2020-10-16 12:02:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:02:33,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:33,732 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, 1, 1, 1, 1] [2020-10-16 12:02:33,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:02:33,732 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash -782976564, now seen corresponding path program 1 times [2020-10-16 12:02:33,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:33,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944041366] [2020-10-16 12:02:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:33,848 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:02:33,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944041366] [2020-10-16 12:02:33,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:33,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:33,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611074229] [2020-10-16 12:02:33,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:02:33,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:02:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:02:33,850 INFO L87 Difference]: Start difference. First operand 1133 states and 3572 transitions. Second operand 4 states. [2020-10-16 12:02:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:33,877 INFO L93 Difference]: Finished difference Result 1484 states and 4581 transitions. [2020-10-16 12:02:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:02:33,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 12:02:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:33,880 INFO L225 Difference]: With dead ends: 1484 [2020-10-16 12:02:33,880 INFO L226 Difference]: Without dead ends: 1136 [2020-10-16 12:02:33,880 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:02:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2020-10-16 12:02:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1133. [2020-10-16 12:02:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-16 12:02:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3470 transitions. [2020-10-16 12:02:33,908 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3470 transitions. Word has length 24 [2020-10-16 12:02:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:33,908 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 3470 transitions. [2020-10-16 12:02:33,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:02:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3470 transitions. [2020-10-16 12:02:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:02:33,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:33,912 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, 1, 1, 1, 1] [2020-10-16 12:02:33,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:02:33,912 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1113578270, now seen corresponding path program 1 times [2020-10-16 12:02:33,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:33,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062413173] [2020-10-16 12:02:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:33,986 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:02:33,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062413173] [2020-10-16 12:02:33,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:33,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:02:33,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860534920] [2020-10-16 12:02:33,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:02:33,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:02:33,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:02:33,989 INFO L87 Difference]: Start difference. First operand 1133 states and 3470 transitions. Second operand 5 states. [2020-10-16 12:02:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,059 INFO L93 Difference]: Finished difference Result 1646 states and 4964 transitions. [2020-10-16 12:02:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:02:34,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-16 12:02:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,063 INFO L225 Difference]: With dead ends: 1646 [2020-10-16 12:02:34,063 INFO L226 Difference]: Without dead ends: 946 [2020-10-16 12:02:34,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:02:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2020-10-16 12:02:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 943. [2020-10-16 12:02:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2020-10-16 12:02:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2696 transitions. [2020-10-16 12:02:34,101 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2696 transitions. Word has length 24 [2020-10-16 12:02:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,102 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 2696 transitions. [2020-10-16 12:02:34,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:02:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2696 transitions. [2020-10-16 12:02:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:02:34,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,107 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, 1, 1, 1, 1] [2020-10-16 12:02:34,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:02:34,108 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2122831838, now seen corresponding path program 2 times [2020-10-16 12:02:34,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718975423] [2020-10-16 12:02:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:34,244 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:02:34,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718975423] [2020-10-16 12:02:34,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:34,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:02:34,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287618330] [2020-10-16 12:02:34,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:02:34,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:34,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:02:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:02:34,246 INFO L87 Difference]: Start difference. First operand 943 states and 2696 transitions. Second operand 7 states. [2020-10-16 12:02:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,330 INFO L93 Difference]: Finished difference Result 914 states and 2638 transitions. [2020-10-16 12:02:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:02:34,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 12:02:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,332 INFO L225 Difference]: With dead ends: 914 [2020-10-16 12:02:34,332 INFO L226 Difference]: Without dead ends: 357 [2020-10-16 12:02:34,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-16 12:02:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2020-10-16 12:02:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-16 12:02:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 964 transitions. [2020-10-16 12:02:34,341 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 964 transitions. Word has length 24 [2020-10-16 12:02:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,343 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 964 transitions. [2020-10-16 12:02:34,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:02:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 964 transitions. [2020-10-16 12:02:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:02:34,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,345 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:34,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:02:34,346 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1759507118, now seen corresponding path program 1 times [2020-10-16 12:02:34,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240627091] [2020-10-16 12:02:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:02:34,576 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:02:34,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240627091] [2020-10-16 12:02:34,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:02:34,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:02:34,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286485046] [2020-10-16 12:02:34,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:02:34,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:02:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:02:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:02:34,578 INFO L87 Difference]: Start difference. First operand 357 states and 964 transitions. Second operand 8 states. [2020-10-16 12:02:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:02:34,763 INFO L93 Difference]: Finished difference Result 467 states and 1254 transitions. [2020-10-16 12:02:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:02:34,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-16 12:02:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:02:34,764 INFO L225 Difference]: With dead ends: 467 [2020-10-16 12:02:34,764 INFO L226 Difference]: Without dead ends: 385 [2020-10-16 12:02:34,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:02:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-16 12:02:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 313. [2020-10-16 12:02:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-16 12:02:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 816 transitions. [2020-10-16 12:02:34,772 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 816 transitions. Word has length 28 [2020-10-16 12:02:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:02:34,772 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 816 transitions. [2020-10-16 12:02:34,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:02:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 816 transitions. [2020-10-16 12:02:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 12:02:34,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:02:34,773 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:02:34,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:02:34,774 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:02:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:02:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1471447744, now seen corresponding path program 2 times [2020-10-16 12:02:34,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:02:34,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616502095] [2020-10-16 12:02:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:02:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:34,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:02:34,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:02:34,920 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:02:34,920 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:02:34,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:02:34,921 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:02:34,949 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L2-->L865: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In100705624 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In100705624 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In100705624 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In100705624 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse2 (not .cse6)) (.cse3 (not .cse7)) (.cse1 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_In100705624 ~x$r_buff1_thd0~0_Out100705624) (or (and .cse0 (or (and (= ~x~0_Out100705624 ~x~0_In100705624) .cse1) (and .cse2 (= ~x$w_buff1~0_In100705624 ~x~0_Out100705624) .cse3))) (and .cse4 .cse5 (= ~x~0_Out100705624 ~x$w_buff0~0_In100705624))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out100705624 0)) (= ~x$r_buff0_thd0~0_In100705624 ~x$r_buff0_thd0~0_Out100705624) (= ULTIMATE.start_assume_abort_if_not_~cond_Out100705624 |ULTIMATE.start_assume_abort_if_not_#in~cond_In100705624|) (or (and .cse4 (= ~x$w_buff0_used~0_Out100705624 0) .cse5) (and (= ~x$w_buff0_used~0_Out100705624 ~x$w_buff0_used~0_In100705624) .cse0)) (or (and .cse2 (= ~x$w_buff1_used~0_Out100705624 0) .cse3) (and (= ~x$w_buff1_used~0_Out100705624 ~x$w_buff1_used~0_In100705624) .cse1))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In100705624, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In100705624, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In100705624|, ~x$w_buff1~0=~x$w_buff1~0_In100705624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In100705624, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In100705624, ~x~0=~x~0_In100705624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In100705624} OutVars{~x$w_buff0~0=~x$w_buff0~0_In100705624, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out100705624, ~x$w_buff1~0=~x$w_buff1~0_In100705624, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out100705624|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out100705624, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out100705624, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out100705624|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out100705624|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out100705624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out100705624, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out100705624|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In100705624|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out100705624|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out100705624, ~x~0=~x~0_Out100705624} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-16 12:02:34,955 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:02:34,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,958 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:02:34,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,958 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:02:34,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,958 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:02:34,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,959 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:02:34,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,959 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:02:34,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,960 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:02:34,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,961 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:02:34,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,961 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:02:34,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,962 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:02:34,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,962 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:02:34,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,962 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:02:34,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,963 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:02:34,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,963 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:02:34,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,964 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:02:34,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,964 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:02:34,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,964 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:02:34,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,964 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:02:34,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,965 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:02:34,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,965 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:02:34,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,966 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:02:34,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,966 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:02:34,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,966 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:02:34,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,967 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:02:34,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,968 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:02:34,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,968 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:02:34,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,968 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:02:34,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,969 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:02:34,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,969 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:02:34,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,969 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:02:34,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,970 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:02:34,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,970 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:02:34,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,970 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:02:34,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:34,971 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:02:34,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:02:35,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:35 BasicIcfg [2020-10-16 12:02:35,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:02:35,046 INFO L168 Benchmark]: Toolchain (without parser) took 19955.66 ms. Allocated memory was 138.4 MB in the beginning and 446.7 MB in the end (delta: 308.3 MB). Free memory was 98.8 MB in the beginning and 53.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 353.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,047 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.3 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.96 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.8 MB in the beginning and 154.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,049 INFO L168 Benchmark]: Boogie Preprocessor took 45.91 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,050 INFO L168 Benchmark]: RCFGBuilder took 2342.94 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 149.4 MB in the beginning and 149.8 MB in the end (delta: -438.2 kB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,050 INFO L168 Benchmark]: TraceAbstraction took 16645.10 ms. Allocated memory was 250.6 MB in the beginning and 446.7 MB in the end (delta: 196.1 MB). Free memory was 149.8 MB in the beginning and 53.7 MB in the end (delta: 96.2 MB). Peak memory consumption was 292.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:02:35,054 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.38 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.3 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.96 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.8 MB in the beginning and 154.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.91 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2342.94 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 149.4 MB in the beginning and 149.8 MB in the end (delta: -438.2 kB). Peak memory consumption was 104.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16645.10 ms. Allocated memory was 250.6 MB in the beginning and 446.7 MB in the end (delta: 196.1 MB). Free memory was 149.8 MB in the beginning and 53.7 MB in the end (delta: 96.2 MB). Peak memory consumption was 292.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1441 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 126 PlacesBefore, 47 PlacesAfterwards, 115 TransitionsBefore, 34 TransitionsAfterwards, 2806 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 7774 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t993; [L848] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t994; [L850] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t995; [L852] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t996; [L854] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L813] 4 z = 1 [L816] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 500 SDtfs, 648 SDslu, 826 SDs, 0 SdLazy, 382 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 724 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 34379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...