/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:00:22,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:00:22,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:00:22,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:00:22,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:00:22,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:00:22,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:00:22,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:00:22,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:00:22,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:00:22,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:00:22,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:00:22,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:00:22,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:00:22,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:00:22,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:00:22,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:00:22,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:00:22,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:00:22,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:00:22,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:00:22,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:00:22,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:00:22,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:00:22,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:00:22,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:00:22,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:00:22,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:00:22,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:00:22,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:00:22,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:00:22,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:00:22,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:00:22,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:00:22,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:00:22,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:00:22,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:00:22,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:00:22,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:00:22,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:00:22,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:00:22,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:00:22,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:00:22,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:00:22,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:00:22,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:00:22,149 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:00:22,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:00:22,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:00:22,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:00:22,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:00:22,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:00:22,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:00:22,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:00:22,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:00:22,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:00:22,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:00:22,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:00:22,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:00:22,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:00:22,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:00:22,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:00:22,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:00:22,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:00:22,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:00:22,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:00:22,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:00:22,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:00:22,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:00:22,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:00:22,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:00:22,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:00:22,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:00:22,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:00:22,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:00:22,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:00:22,441 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:00:22,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-26 23:00:22,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e91bc6c/aef06c0941d545ad9f2e9a548232e638/FLAG2bb525c1c [2019-12-26 23:00:23,046 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:00:23,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-26 23:00:23,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e91bc6c/aef06c0941d545ad9f2e9a548232e638/FLAG2bb525c1c [2019-12-26 23:00:23,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e91bc6c/aef06c0941d545ad9f2e9a548232e638 [2019-12-26 23:00:23,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:00:23,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:00:23,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:23,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:00:23,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:00:23,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:23" (1/1) ... [2019-12-26 23:00:23,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3661cc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:23, skipping insertion in model container [2019-12-26 23:00:23,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:00:23" (1/1) ... [2019-12-26 23:00:23,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:00:23,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:00:23,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:23,928 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:00:23,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:00:24,082 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:00:24,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24 WrapperNode [2019-12-26 23:00:24,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:00:24,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:24,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:00:24,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:00:24,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:00:24,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:00:24,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:00:24,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:00:24,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... [2019-12-26 23:00:24,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:00:24,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:00:24,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:00:24,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:00:24,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:00:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:00:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:00:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:00:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:00:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:00:24,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:00:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:00:24,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:00:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:00:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:00:24,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:00:24,282 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:00:25,023 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:00:25,023 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:00:25,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:25 BoogieIcfgContainer [2019-12-26 23:00:25,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:00:25,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:00:25,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:00:25,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:00:25,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:00:23" (1/3) ... [2019-12-26 23:00:25,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76681e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:25, skipping insertion in model container [2019-12-26 23:00:25,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:00:24" (2/3) ... [2019-12-26 23:00:25,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76681e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:00:25, skipping insertion in model container [2019-12-26 23:00:25,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:00:25" (3/3) ... [2019-12-26 23:00:25,039 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-26 23:00:25,051 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:00:25,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:00:25,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:00:25,065 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:00:25,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,135 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,156 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,156 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:00:25,178 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:00:25,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:00:25,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:00:25,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:00:25,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:00:25,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:00:25,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:00:25,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:00:25,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:00:25,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-26 23:00:25,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:25,329 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:25,329 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:25,343 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:25,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 23:00:25,404 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 23:00:25,405 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:00:25,411 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:00:25,423 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 23:00:25,424 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:00:29,732 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-26 23:00:29,863 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-26 23:00:29,863 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-26 23:00:29,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-26 23:00:30,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-26 23:00:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-26 23:00:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:00:30,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:30,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:00:30,303 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-26 23:00:30,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:30,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551185698] [2019-12-26 23:00:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551185698] [2019-12-26 23:00:30,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:30,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:00:30,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474693873] [2019-12-26 23:00:30,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:30,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:30,573 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-26 23:00:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:30,897 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-26 23:00:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:30,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:00:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:31,011 INFO L225 Difference]: With dead ends: 8377 [2019-12-26 23:00:31,011 INFO L226 Difference]: Without dead ends: 8208 [2019-12-26 23:00:31,013 INFO L631 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 [2019-12-26 23:00:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-26 23:00:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-26 23:00:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-26 23:00:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-26 23:00:31,439 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-26 23:00:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:31,441 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-26 23:00:31,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-26 23:00:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:00:31,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:31,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:31,445 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-26 23:00:31,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:31,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793135023] [2019-12-26 23:00:31,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:31,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793135023] [2019-12-26 23:00:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:31,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:31,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897913902] [2019-12-26 23:00:31,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:31,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:31,572 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-26 23:00:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:31,610 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-26 23:00:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:31,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:00:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:31,619 INFO L225 Difference]: With dead ends: 1326 [2019-12-26 23:00:31,620 INFO L226 Difference]: Without dead ends: 1326 [2019-12-26 23:00:31,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-26 23:00:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-26 23:00:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-26 23:00:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-26 23:00:31,668 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-26 23:00:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:31,669 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-26 23:00:31,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-26 23:00:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:00:31,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:31,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:31,673 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-26 23:00:31,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:31,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233631156] [2019-12-26 23:00:31,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:31,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233631156] [2019-12-26 23:00:31,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:31,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:31,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154680081] [2019-12-26 23:00:31,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:31,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:31,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:31,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:31,867 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-26 23:00:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:32,244 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-26 23:00:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:00:32,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:00:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:32,255 INFO L225 Difference]: With dead ends: 1806 [2019-12-26 23:00:32,255 INFO L226 Difference]: Without dead ends: 1806 [2019-12-26 23:00:32,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-26 23:00:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-26 23:00:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-26 23:00:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-26 23:00:32,300 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-26 23:00:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:32,300 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-26 23:00:32,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-26 23:00:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 23:00:32,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:32,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:32,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-26 23:00:32,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:32,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24924905] [2019-12-26 23:00:32,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:32,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24924905] [2019-12-26 23:00:32,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:32,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:32,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854183603] [2019-12-26 23:00:32,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:00:32,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:00:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:32,373 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-26 23:00:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:32,400 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-26 23:00:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:00:32,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-26 23:00:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:32,403 INFO L225 Difference]: With dead ends: 356 [2019-12-26 23:00:32,403 INFO L226 Difference]: Without dead ends: 356 [2019-12-26 23:00:32,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:00:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-26 23:00:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-26 23:00:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-26 23:00:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-26 23:00:32,416 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-26 23:00:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:32,417 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-26 23:00:32,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:00:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-26 23:00:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:32,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:32,420 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:32,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-26 23:00:32,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:32,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571466054] [2019-12-26 23:00:32,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:32,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571466054] [2019-12-26 23:00:32,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:32,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:32,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649231305] [2019-12-26 23:00:32,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:32,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:32,560 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-26 23:00:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:32,616 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-26 23:00:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:32,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:32,619 INFO L225 Difference]: With dead ends: 331 [2019-12-26 23:00:32,619 INFO L226 Difference]: Without dead ends: 331 [2019-12-26 23:00:32,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-26 23:00:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-26 23:00:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-26 23:00:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-26 23:00:32,626 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-26 23:00:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:32,629 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-26 23:00:32,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-26 23:00:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:32,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:32,633 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:32,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-26 23:00:32,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:32,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623634831] [2019-12-26 23:00:32,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:32,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623634831] [2019-12-26 23:00:32,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:32,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:00:32,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998610227] [2019-12-26 23:00:32,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:32,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:32,760 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-26 23:00:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:32,972 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-26 23:00:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:00:32,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-26 23:00:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:32,975 INFO L225 Difference]: With dead ends: 458 [2019-12-26 23:00:32,975 INFO L226 Difference]: Without dead ends: 458 [2019-12-26 23:00:32,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-26 23:00:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-26 23:00:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-26 23:00:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-26 23:00:32,985 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-26 23:00:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:32,985 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-26 23:00:32,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-26 23:00:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:32,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:32,987 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:32,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-26 23:00:32,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:32,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52134336] [2019-12-26 23:00:32,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:33,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52134336] [2019-12-26 23:00:33,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:33,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:33,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832514534] [2019-12-26 23:00:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:33,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:33,106 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-26 23:00:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:33,437 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-26 23:00:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:00:33,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-26 23:00:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:33,440 INFO L225 Difference]: With dead ends: 513 [2019-12-26 23:00:33,440 INFO L226 Difference]: Without dead ends: 513 [2019-12-26 23:00:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:00:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-26 23:00:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-26 23:00:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-26 23:00:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-26 23:00:33,451 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-26 23:00:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:33,451 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-26 23:00:33,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-26 23:00:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:33,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:33,453 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:33,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-26 23:00:33,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:33,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521915990] [2019-12-26 23:00:33,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521915990] [2019-12-26 23:00:33,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:33,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:33,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859525013] [2019-12-26 23:00:33,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:00:33,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:00:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:00:33,588 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-26 23:00:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:33,945 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-26 23:00:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:00:33,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-26 23:00:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:33,950 INFO L225 Difference]: With dead ends: 694 [2019-12-26 23:00:33,951 INFO L226 Difference]: Without dead ends: 694 [2019-12-26 23:00:33,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:00:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-26 23:00:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-26 23:00:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-26 23:00:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-26 23:00:33,964 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-26 23:00:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:33,964 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-26 23:00:33,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-26 23:00:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:33,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:33,966 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:33,966 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-26 23:00:33,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:33,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151080668] [2019-12-26 23:00:33,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:34,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151080668] [2019-12-26 23:00:34,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:34,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720348705] [2019-12-26 23:00:34,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:34,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:34,028 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-26 23:00:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:34,041 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-26 23:00:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:34,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:34,044 INFO L225 Difference]: With dead ends: 406 [2019-12-26 23:00:34,044 INFO L226 Difference]: Without dead ends: 406 [2019-12-26 23:00:34,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-26 23:00:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-26 23:00:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-26 23:00:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-26 23:00:34,052 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-26 23:00:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:34,052 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-26 23:00:34,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-26 23:00:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:00:34,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:34,054 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:34,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-26 23:00:34,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:34,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832321390] [2019-12-26 23:00:34,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:34,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832321390] [2019-12-26 23:00:34,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:34,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:34,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533372221] [2019-12-26 23:00:34,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:00:34,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:00:34,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:34,184 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 7 states. [2019-12-26 23:00:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:34,290 INFO L93 Difference]: Finished difference Result 748 states and 1355 transitions. [2019-12-26 23:00:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:00:34,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 23:00:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:34,293 INFO L225 Difference]: With dead ends: 748 [2019-12-26 23:00:34,293 INFO L226 Difference]: Without dead ends: 369 [2019-12-26 23:00:34,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:00:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-26 23:00:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 321. [2019-12-26 23:00:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-26 23:00:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 572 transitions. [2019-12-26 23:00:34,300 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 572 transitions. Word has length 53 [2019-12-26 23:00:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:34,301 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 572 transitions. [2019-12-26 23:00:34,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:00:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 572 transitions. [2019-12-26 23:00:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:00:34,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:34,303 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:34,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1236840700, now seen corresponding path program 2 times [2019-12-26 23:00:34,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:34,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630366412] [2019-12-26 23:00:34,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:34,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630366412] [2019-12-26 23:00:34,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:34,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:00:34,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337503481] [2019-12-26 23:00:34,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:34,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:34,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:34,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:34,405 INFO L87 Difference]: Start difference. First operand 321 states and 572 transitions. Second operand 3 states. [2019-12-26 23:00:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:34,446 INFO L93 Difference]: Finished difference Result 321 states and 571 transitions. [2019-12-26 23:00:34,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:34,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:00:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:34,448 INFO L225 Difference]: With dead ends: 321 [2019-12-26 23:00:34,448 INFO L226 Difference]: Without dead ends: 321 [2019-12-26 23:00:34,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-26 23:00:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 209. [2019-12-26 23:00:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-26 23:00:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 369 transitions. [2019-12-26 23:00:34,454 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 369 transitions. Word has length 53 [2019-12-26 23:00:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:34,454 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 369 transitions. [2019-12-26 23:00:34,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 369 transitions. [2019-12-26 23:00:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:34,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:34,455 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:34,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 1 times [2019-12-26 23:00:34,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:34,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398098570] [2019-12-26 23:00:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:34,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398098570] [2019-12-26 23:00:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:00:34,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113190086] [2019-12-26 23:00:34,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:00:34,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:00:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:00:34,727 INFO L87 Difference]: Start difference. First operand 209 states and 369 transitions. Second operand 13 states. [2019-12-26 23:00:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:35,235 INFO L93 Difference]: Finished difference Result 376 states and 647 transitions. [2019-12-26 23:00:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:00:35,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:00:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:35,239 INFO L225 Difference]: With dead ends: 376 [2019-12-26 23:00:35,240 INFO L226 Difference]: Without dead ends: 343 [2019-12-26 23:00:35,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:00:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-26 23:00:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-26 23:00:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-26 23:00:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 540 transitions. [2019-12-26 23:00:35,278 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 540 transitions. Word has length 54 [2019-12-26 23:00:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:35,278 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 540 transitions. [2019-12-26 23:00:35,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:00:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 540 transitions. [2019-12-26 23:00:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:35,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:35,279 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:35,280 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 2 times [2019-12-26 23:00:35,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:35,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411854845] [2019-12-26 23:00:35,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:35,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411854845] [2019-12-26 23:00:35,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:35,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:00:35,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239433818] [2019-12-26 23:00:35,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:00:35,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:00:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:00:35,531 INFO L87 Difference]: Start difference. First operand 309 states and 540 transitions. Second operand 13 states. [2019-12-26 23:00:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:36,047 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2019-12-26 23:00:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:00:36,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:00:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:36,050 INFO L225 Difference]: With dead ends: 414 [2019-12-26 23:00:36,050 INFO L226 Difference]: Without dead ends: 379 [2019-12-26 23:00:36,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:00:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-26 23:00:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-26 23:00:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-26 23:00:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-26 23:00:36,058 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 54 [2019-12-26 23:00:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:36,058 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-26 23:00:36,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:00:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-26 23:00:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:00:36,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:36,060 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:36,060 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 3 times [2019-12-26 23:00:36,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:36,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075152870] [2019-12-26 23:00:36,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:36,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:36,161 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:36,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:00:36,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 23:00:36,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:00:36,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-691210282 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-691210282 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-691210282| |P0Thread1of1ForFork0_#t~ite4_Out-691210282|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-691210282| ~x$w_buff1~0_In-691210282) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In-691210282 |P0Thread1of1ForFork0_#t~ite3_Out-691210282|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-691210282, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-691210282, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-691210282, ~x~0=~x~0_In-691210282} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-691210282|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-691210282|, ~x$w_buff1~0=~x$w_buff1~0_In-691210282, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-691210282, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-691210282, ~x~0=~x~0_In-691210282} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:00:36,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In981253001 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In981253001 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out981253001| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out981253001| ~x$w_buff0_used~0_In981253001)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In981253001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In981253001} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out981253001|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In981253001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In981253001} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:00:36,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1199543004 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1199543004 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1199543004 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1199543004 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1199543004| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1199543004| ~x$w_buff1_used~0_In-1199543004)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1199543004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1199543004, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1199543004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1199543004} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1199543004|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1199543004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1199543004, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1199543004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1199543004} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:00:36,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1089095321 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1089095321 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1089095321 |P1Thread1of1ForFork1_#t~ite11_Out-1089095321|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1089095321|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1089095321, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1089095321} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1089095321|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1089095321, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1089095321} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:00:36,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1900150831 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1900150831 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In1900150831 |P0Thread1of1ForFork0_#t~ite7_Out1900150831|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1900150831| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1900150831, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1900150831} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1900150831, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1900150831|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1900150831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:00:36,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-956254217 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-956254217 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-956254217 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-956254217 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-956254217| ~x$r_buff1_thd1~0_In-956254217)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-956254217| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-956254217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-956254217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-956254217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-956254217} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-956254217, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-956254217|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-956254217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-956254217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-956254217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:00:36,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:00:36,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1003431318 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1003431318 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1003431318 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1003431318 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1003431318| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1003431318 |P1Thread1of1ForFork1_#t~ite12_Out-1003431318|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1003431318, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1003431318, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1003431318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1003431318} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1003431318, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1003431318, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1003431318|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1003431318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1003431318} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:00:36,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In325709633 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In325709633 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In325709633 ~x$r_buff0_thd2~0_Out325709633)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out325709633)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In325709633, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325709633} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out325709633|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out325709633, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325709633} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:00:36,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1125063849 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1125063849 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1125063849 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1125063849 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out1125063849| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out1125063849| ~x$r_buff1_thd2~0_In1125063849)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1125063849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1125063849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1125063849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1125063849} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1125063849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1125063849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1125063849, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1125063849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1125063849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:00:36,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:00:36,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:00:36,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1820932721 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1820932721 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out1820932721| |ULTIMATE.start_main_#t~ite18_Out1820932721|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1820932721| ~x$w_buff1~0_In1820932721) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1820932721| ~x~0_In1820932721) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1820932721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1820932721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1820932721, ~x~0=~x~0_In1820932721} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1820932721|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1820932721|, ~x$w_buff1~0=~x$w_buff1~0_In1820932721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1820932721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1820932721, ~x~0=~x~0_In1820932721} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-26 23:00:36,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In288535533 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In288535533 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In288535533 |ULTIMATE.start_main_#t~ite19_Out288535533|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out288535533|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In288535533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In288535533} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In288535533, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out288535533|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In288535533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:00:36,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-95086875 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-95086875 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-95086875 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-95086875 256) 0))) (or (and (= ~x$w_buff1_used~0_In-95086875 |ULTIMATE.start_main_#t~ite20_Out-95086875|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-95086875|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-95086875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-95086875, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-95086875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95086875} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-95086875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-95086875, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-95086875|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-95086875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95086875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:00:36,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1946280550 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1946280550 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1946280550|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-1946280550 |ULTIMATE.start_main_#t~ite21_Out-1946280550|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1946280550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1946280550} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1946280550, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1946280550|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1946280550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:00:36,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In527834754 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In527834754 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In527834754 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In527834754 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In527834754 |ULTIMATE.start_main_#t~ite22_Out527834754|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out527834754|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In527834754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In527834754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In527834754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527834754} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In527834754, ~x$w_buff1_used~0=~x$w_buff1_used~0_In527834754, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In527834754, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out527834754|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527834754} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:00:36,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-842261724 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-842261724 |ULTIMATE.start_main_#t~ite32_Out-842261724|) (= |ULTIMATE.start_main_#t~ite31_In-842261724| |ULTIMATE.start_main_#t~ite31_Out-842261724|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-842261724 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-842261724 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-842261724 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-842261724 256)))) (= ~x$w_buff1~0_In-842261724 |ULTIMATE.start_main_#t~ite31_Out-842261724|) .cse0 (= |ULTIMATE.start_main_#t~ite31_Out-842261724| |ULTIMATE.start_main_#t~ite32_Out-842261724|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-842261724, ~x$w_buff1~0=~x$w_buff1~0_In-842261724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-842261724, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-842261724, ~weak$$choice2~0=~weak$$choice2~0_In-842261724, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-842261724|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-842261724} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-842261724, ~x$w_buff1~0=~x$w_buff1~0_In-842261724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-842261724, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-842261724|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-842261724, ~weak$$choice2~0=~weak$$choice2~0_In-842261724, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-842261724|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-842261724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-26 23:00:36,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 23:00:36,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:00:36,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:00:36,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:36 BasicIcfg [2019-12-26 23:00:36,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:36,251 INFO L168 Benchmark]: Toolchain (without parser) took 12896.69 ms. Allocated memory was 137.9 MB in the beginning and 371.7 MB in the end (delta: 233.8 MB). Free memory was 101.3 MB in the beginning and 166.7 MB in the end (delta: -65.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,252 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.41 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 153.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,254 INFO L168 Benchmark]: Boogie Preprocessor took 42.90 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,255 INFO L168 Benchmark]: RCFGBuilder took 821.89 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,256 INFO L168 Benchmark]: TraceAbstraction took 11222.14 ms. Allocated memory was 202.9 MB in the beginning and 371.7 MB in the end (delta: 168.8 MB). Free memory was 107.6 MB in the beginning and 166.7 MB in the end (delta: -59.0 MB). Peak memory consumption was 109.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:36,260 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.41 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.36 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 153.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.90 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.89 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11222.14 ms. Allocated memory was 202.9 MB in the beginning and 371.7 MB in the end (delta: 168.8 MB). Free memory was 107.6 MB in the beginning and 166.7 MB in the end (delta: -59.0 MB). Peak memory consumption was 109.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 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) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 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 [L756] 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) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 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 [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 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) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 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) [L799] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L799] 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)) [L800] 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)) [L801] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L801] 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)) [L802] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 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)) [L804] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L804] 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)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1280 SDtfs, 1086 SDslu, 3005 SDs, 0 SdLazy, 1639 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 887 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 89561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...