/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:48:19,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:48:19,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:48:19,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:48:19,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:48:19,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:48:19,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:48:19,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:48:19,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:48:19,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:48:19,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:48:19,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:48:19,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:48:19,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:48:19,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:48:19,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:48:19,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:48:19,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:48:19,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:48:19,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:48:19,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:48:19,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:48:19,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:48:19,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:48:19,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:48:19,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:48:19,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:48:19,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:48:19,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:48:19,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:48:19,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:48:19,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:48:19,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:48:19,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:48:19,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:48:19,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:48:19,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:48:19,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:48:19,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:48:19,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:48:19,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:48:19,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:48:19,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:48:19,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:48:19,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:48:19,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:48:19,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:48:19,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:48:19,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:48:19,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:48:19,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:48:19,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:48:19,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:48:19,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:48:19,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:48:19,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:48:19,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:48:19,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:48:19,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:48:19,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:48:19,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:48:19,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:48:19,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:48:19,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:48:19,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:48:19,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:48:19,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:48:19,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:48:19,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:48:19,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:48:19,436 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:48:19,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-18 16:48:19,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfaeb3a7/a7fdaf391d7a40169fc26224cc13fcf8/FLAG58748162b [2019-12-18 16:48:20,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:48:20,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-18 16:48:20,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfaeb3a7/a7fdaf391d7a40169fc26224cc13fcf8/FLAG58748162b [2019-12-18 16:48:20,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfaeb3a7/a7fdaf391d7a40169fc26224cc13fcf8 [2019-12-18 16:48:20,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:48:20,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:48:20,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:48:20,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:48:20,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:48:20,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:48:20" (1/1) ... [2019-12-18 16:48:20,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abb0932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:20, skipping insertion in model container [2019-12-18 16:48:20,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:48:20" (1/1) ... [2019-12-18 16:48:20,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:48:20,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:48:20,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:48:20,986 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:48:21,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:48:21,126 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:48:21,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21 WrapperNode [2019-12-18 16:48:21,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:48:21,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:48:21,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:48:21,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:48:21,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:48:21,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:48:21,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:48:21,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:48:21,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (1/1) ... [2019-12-18 16:48:21,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:48:21,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:48:21,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:48:21,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:48:21,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (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-18 16:48:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:48:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:48:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:48:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:48:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:48:21,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:48:21,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:48:21,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:48:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:48:21,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:48:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:48:21,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:48:21,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:48:21,321 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:48:22,109 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:48:22,110 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:48:22,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:48:22 BoogieIcfgContainer [2019-12-18 16:48:22,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:48:22,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:48:22,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:48:22,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:48:22,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:48:20" (1/3) ... [2019-12-18 16:48:22,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d38fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:48:22, skipping insertion in model container [2019-12-18 16:48:22,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:48:21" (2/3) ... [2019-12-18 16:48:22,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d38fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:48:22, skipping insertion in model container [2019-12-18 16:48:22,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:48:22" (3/3) ... [2019-12-18 16:48:22,127 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2019-12-18 16:48:22,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:48:22,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:48:22,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:48:22,151 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:48:22,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,272 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,273 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:48:22,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:48:22,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:48:22,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:48:22,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:48:22,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:48:22,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:48:22,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:48:22,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:48:22,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:48:22,329 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 16:48:22,331 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:48:22,417 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:48:22,417 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:48:22,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:48:22,460 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 16:48:22,506 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 16:48:22,507 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:48:22,515 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:48:22,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:48:22,536 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:48:27,964 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:48:28,110 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:48:28,126 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-18 16:48:28,127 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 16:48:28,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 16:48:38,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 16:48:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 16:48:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:48:38,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:38,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:48:38,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-18 16:48:38,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:38,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420235147] [2019-12-18 16:48:38,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:38,386 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-18 16:48:38,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420235147] [2019-12-18 16:48:38,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:38,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:48:38,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610788473] [2019-12-18 16:48:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:38,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:38,406 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 16:48:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:41,357 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 16:48:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:41,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:48:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:41,945 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 16:48:41,946 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 16:48:41,947 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-18 16:48:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 16:48:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 16:48:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 16:48:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 16:48:49,626 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 16:48:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:49,626 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 16:48:49,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:48:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 16:48:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:48:49,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:49,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:49,636 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-18 16:48:49,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:49,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854084922] [2019-12-18 16:48:49,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:49,733 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-18 16:48:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854084922] [2019-12-18 16:48:49,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:49,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:49,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859760843] [2019-12-18 16:48:49,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:49,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:49,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:49,736 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 16:48:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:50,130 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 16:48:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:50,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:48:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:50,240 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 16:48:50,240 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 16:48:50,241 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-18 16:48:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 16:48:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 16:48:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 16:48:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 16:48:50,906 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 16:48:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:50,906 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 16:48:50,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:48:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 16:48:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:48:50,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:50,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:50,910 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-18 16:48:50,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:50,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738283528] [2019-12-18 16:48:50,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:51,031 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-18 16:48:51,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738283528] [2019-12-18 16:48:51,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:51,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:51,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980166983] [2019-12-18 16:48:51,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:48:51,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:48:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:48:51,035 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 16:48:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:51,398 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 16:48:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:48:51,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:48:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:51,455 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 16:48:51,455 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 16:48:51,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:48:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 16:48:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 16:48:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 16:48:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 16:48:53,771 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 16:48:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:53,772 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 16:48:53,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:48:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 16:48:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:48:53,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:53,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:53,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:53,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-18 16:48:53,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:53,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104820270] [2019-12-18 16:48:53,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:53,837 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-18 16:48:53,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104820270] [2019-12-18 16:48:53,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:53,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:53,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014021022] [2019-12-18 16:48:53,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:48:53,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:48:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:48:53,842 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 16:48:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:54,135 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 16:48:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:48:54,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:48:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:54,191 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 16:48:54,191 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 16:48:54,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:48:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 16:48:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 16:48:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 16:48:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 16:48:55,187 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 16:48:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:55,188 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 16:48:55,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:48:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 16:48:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:48:55,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:55,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:48:55,191 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-18 16:48:55,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:55,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232107861] [2019-12-18 16:48:55,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:55,240 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-18 16:48:55,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232107861] [2019-12-18 16:48:55,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:55,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:48:55,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406626968] [2019-12-18 16:48:55,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:48:55,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:55,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:48:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:48:55,242 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 16:48:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:55,544 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 16:48:55,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:48:55,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:48:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:55,608 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 16:48:55,609 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 16:48:55,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:48:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 16:48:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 16:48:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 16:48:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 16:48:56,216 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 16:48:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 16:48:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:48:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 16:48:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:48:56,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:56,227 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] [2019-12-18 16:48:56,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-18 16:48:56,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:56,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131844690] [2019-12-18 16:48:56,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:56,323 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-18 16:48:56,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131844690] [2019-12-18 16:48:56,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:56,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:48:56,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49783146] [2019-12-18 16:48:56,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:48:56,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:48:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:48:56,325 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 16:48:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:57,223 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 16:48:57,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:48:57,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:48:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:57,312 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 16:48:57,312 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 16:48:57,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:48:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 16:48:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 16:48:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 16:48:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 16:48:57,965 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 16:48:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:57,965 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 16:48:57,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:48:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 16:48:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:48:57,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:57,974 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] [2019-12-18 16:48:57,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-18 16:48:57,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:57,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462587634] [2019-12-18 16:48:57,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:58,054 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-18 16:48:58,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462587634] [2019-12-18 16:48:58,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:58,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:48:58,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608123319] [2019-12-18 16:48:58,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:48:58,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:48:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:48:58,056 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 16:48:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:58,605 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 16:48:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:48:58,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:48:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:58,685 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 16:48:58,685 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 16:48:58,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:48:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 16:48:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 16:48:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 16:48:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 16:48:59,532 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 16:48:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:59,532 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 16:48:59,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:48:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 16:48:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:48:59,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:59,547 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] [2019-12-18 16:48:59,547 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:59,548 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-18 16:48:59,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:59,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542963867] [2019-12-18 16:48:59,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:59,594 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-18 16:48:59,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542963867] [2019-12-18 16:48:59,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:59,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:48:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710432392] [2019-12-18 16:48:59,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:48:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:48:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:48:59,597 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 16:48:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:59,661 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 16:48:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:48:59,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:48:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:59,678 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 16:48:59,678 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 16:48:59,678 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-18 16:48:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 16:48:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 16:48:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 16:48:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 16:48:59,835 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 16:48:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:48:59,835 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 16:48:59,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:48:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 16:48:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:48:59,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:48:59,850 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] [2019-12-18 16:48:59,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:48:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:48:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-18 16:48:59,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:48:59,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666909964] [2019-12-18 16:48:59,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:48:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:48:59,894 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-18 16:48:59,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666909964] [2019-12-18 16:48:59,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:48:59,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:48:59,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61019133] [2019-12-18 16:48:59,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:48:59,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:48:59,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:48:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:48:59,897 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 16:48:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:48:59,974 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-18 16:48:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:48:59,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:48:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:48:59,995 INFO L225 Difference]: With dead ends: 15100 [2019-12-18 16:48:59,995 INFO L226 Difference]: Without dead ends: 15100 [2019-12-18 16:48:59,995 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-18 16:49:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-18 16:49:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-18 16:49:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-18 16:49:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-18 16:49:00,183 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-18 16:49:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:00,184 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-18 16:49:00,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-18 16:49:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:49:00,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:00,201 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] [2019-12-18 16:49:00,201 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-18 16:49:00,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:00,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154935154] [2019-12-18 16:49:00,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:00,263 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-18 16:49:00,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154935154] [2019-12-18 16:49:00,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:00,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:49:00,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500492623] [2019-12-18 16:49:00,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:49:00,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:00,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:49:00,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:00,266 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-18 16:49:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:00,331 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-18 16:49:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:49:00,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 16:49:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:00,354 INFO L225 Difference]: With dead ends: 11017 [2019-12-18 16:49:00,354 INFO L226 Difference]: Without dead ends: 11017 [2019-12-18 16:49:00,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-18 16:49:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-18 16:49:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 16:49:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 16:49:00,525 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-18 16:49:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:00,525 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 16:49:00,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:49:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 16:49:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:00,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:00,542 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-18 16:49:00,543 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-18 16:49:00,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:00,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337165418] [2019-12-18 16:49:00,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:00,607 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-18 16:49:00,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337165418] [2019-12-18 16:49:00,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:00,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:49:00,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251921741] [2019-12-18 16:49:00,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:49:00,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:00,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:49:00,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:49:00,609 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-18 16:49:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:00,707 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-18 16:49:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:49:00,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 16:49:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:00,728 INFO L225 Difference]: With dead ends: 18723 [2019-12-18 16:49:00,728 INFO L226 Difference]: Without dead ends: 8627 [2019-12-18 16:49:00,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:49:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-18 16:49:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-18 16:49:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-18 16:49:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-18 16:49:01,031 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-18 16:49:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:01,031 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-18 16:49:01,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:49:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-18 16:49:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:01,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:01,050 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-18 16:49:01,050 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-18 16:49:01,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:01,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704478292] [2019-12-18 16:49:01,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:01,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-18 16:49:01,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704478292] [2019-12-18 16:49:01,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:01,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:01,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099472701] [2019-12-18 16:49:01,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:01,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:01,185 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-18 16:49:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:01,552 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-18 16:49:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:01,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:49:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:01,582 INFO L225 Difference]: With dead ends: 24029 [2019-12-18 16:49:01,583 INFO L226 Difference]: Without dead ends: 18333 [2019-12-18 16:49:01,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:49:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-18 16:49:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-18 16:49:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-18 16:49:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-18 16:49:01,809 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-18 16:49:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:01,810 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-18 16:49:01,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-18 16:49:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:01,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:01,827 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-18 16:49:01,827 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-18 16:49:01,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:01,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638669734] [2019-12-18 16:49:01,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:01,908 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-18 16:49:01,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638669734] [2019-12-18 16:49:01,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:01,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:49:01,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639125122] [2019-12-18 16:49:01,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:49:01,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:49:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:49:01,910 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-18 16:49:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:02,313 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-18 16:49:02,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:49:02,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 16:49:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:02,362 INFO L225 Difference]: With dead ends: 29619 [2019-12-18 16:49:02,363 INFO L226 Difference]: Without dead ends: 21040 [2019-12-18 16:49:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:49:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-18 16:49:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-18 16:49:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-18 16:49:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-18 16:49:02,736 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-18 16:49:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:02,737 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-18 16:49:02,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:49:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-18 16:49:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:02,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:02,755 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-18 16:49:02,755 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-18 16:49:02,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:02,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774099191] [2019-12-18 16:49:02,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:02,808 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-18 16:49:02,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774099191] [2019-12-18 16:49:02,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:02,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:02,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775835804] [2019-12-18 16:49:02,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:02,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:02,810 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-18 16:49:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:02,903 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-18 16:49:02,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:02,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:49:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:02,916 INFO L225 Difference]: With dead ends: 19683 [2019-12-18 16:49:02,916 INFO L226 Difference]: Without dead ends: 6496 [2019-12-18 16:49:02,916 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-18 16:49:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-18 16:49:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-18 16:49:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-18 16:49:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-18 16:49:03,026 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-18 16:49:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:03,026 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-18 16:49:03,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-18 16:49:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:03,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:03,034 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-18 16:49:03,035 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-18 16:49:03,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:03,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345242243] [2019-12-18 16:49:03,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:03,156 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-18 16:49:03,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345242243] [2019-12-18 16:49:03,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:03,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:03,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808983817] [2019-12-18 16:49:03,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:03,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:03,158 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-18 16:49:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:04,621 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-18 16:49:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 16:49:04,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:49:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:04,662 INFO L225 Difference]: With dead ends: 34361 [2019-12-18 16:49:04,663 INFO L226 Difference]: Without dead ends: 27058 [2019-12-18 16:49:04,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 16:49:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-18 16:49:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-18 16:49:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-18 16:49:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-18 16:49:04,931 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-18 16:49:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:04,931 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-18 16:49:04,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-18 16:49:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:04,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:04,942 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-18 16:49:04,942 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-18 16:49:04,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:04,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114465334] [2019-12-18 16:49:04,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:05,056 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-18 16:49:05,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114465334] [2019-12-18 16:49:05,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:05,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:05,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353531671] [2019-12-18 16:49:05,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:05,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:05,058 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-18 16:49:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:06,222 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-18 16:49:06,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 16:49:06,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 16:49:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:06,258 INFO L225 Difference]: With dead ends: 25540 [2019-12-18 16:49:06,258 INFO L226 Difference]: Without dead ends: 23475 [2019-12-18 16:49:06,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:49:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-18 16:49:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-18 16:49:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-18 16:49:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-18 16:49:06,495 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-18 16:49:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:06,496 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-18 16:49:06,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-18 16:49:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:49:06,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:06,506 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-18 16:49:06,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-18 16:49:06,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:06,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826656022] [2019-12-18 16:49:06,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:06,597 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-18 16:49:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826656022] [2019-12-18 16:49:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:06,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:06,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054940103] [2019-12-18 16:49:06,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:06,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:06,599 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 3 states. [2019-12-18 16:49:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:06,648 INFO L93 Difference]: Finished difference Result 8821 states and 28687 transitions. [2019-12-18 16:49:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:06,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 16:49:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:06,666 INFO L225 Difference]: With dead ends: 8821 [2019-12-18 16:49:06,666 INFO L226 Difference]: Without dead ends: 8821 [2019-12-18 16:49:06,667 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-18 16:49:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2019-12-18 16:49:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 8821. [2019-12-18 16:49:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2019-12-18 16:49:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 28687 transitions. [2019-12-18 16:49:06,869 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 28687 transitions. Word has length 53 [2019-12-18 16:49:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:06,869 INFO L462 AbstractCegarLoop]: Abstraction has 8821 states and 28687 transitions. [2019-12-18 16:49:06,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 28687 transitions. [2019-12-18 16:49:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 16:49:06,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:06,887 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-18 16:49:06,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158321, now seen corresponding path program 1 times [2019-12-18 16:49:06,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:06,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410197801] [2019-12-18 16:49:06,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:06,960 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-18 16:49:06,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410197801] [2019-12-18 16:49:06,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:06,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:49:06,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502051224] [2019-12-18 16:49:06,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:49:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:49:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:49:06,963 INFO L87 Difference]: Start difference. First operand 8821 states and 28687 transitions. Second operand 3 states. [2019-12-18 16:49:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:07,029 INFO L93 Difference]: Finished difference Result 7804 states and 24650 transitions. [2019-12-18 16:49:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:49:07,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 16:49:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:07,049 INFO L225 Difference]: With dead ends: 7804 [2019-12-18 16:49:07,049 INFO L226 Difference]: Without dead ends: 7804 [2019-12-18 16:49:07,051 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-18 16:49:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7804 states. [2019-12-18 16:49:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7804 to 7628. [2019-12-18 16:49:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7628 states. [2019-12-18 16:49:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7628 states to 7628 states and 24072 transitions. [2019-12-18 16:49:07,366 INFO L78 Accepts]: Start accepts. Automaton has 7628 states and 24072 transitions. Word has length 54 [2019-12-18 16:49:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:07,366 INFO L462 AbstractCegarLoop]: Abstraction has 7628 states and 24072 transitions. [2019-12-18 16:49:07,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:49:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7628 states and 24072 transitions. [2019-12-18 16:49:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:49:07,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:07,378 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, 1] [2019-12-18 16:49:07,378 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash 404282337, now seen corresponding path program 1 times [2019-12-18 16:49:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157351834] [2019-12-18 16:49:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:07,511 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-18 16:49:07,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157351834] [2019-12-18 16:49:07,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:07,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:49:07,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131241721] [2019-12-18 16:49:07,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:49:07,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:49:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:49:07,514 INFO L87 Difference]: Start difference. First operand 7628 states and 24072 transitions. Second operand 9 states. [2019-12-18 16:49:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:08,549 INFO L93 Difference]: Finished difference Result 13518 states and 42077 transitions. [2019-12-18 16:49:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:49:08,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 16:49:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:08,563 INFO L225 Difference]: With dead ends: 13518 [2019-12-18 16:49:08,563 INFO L226 Difference]: Without dead ends: 9336 [2019-12-18 16:49:08,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:49:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2019-12-18 16:49:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 7946. [2019-12-18 16:49:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7946 states. [2019-12-18 16:49:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 24806 transitions. [2019-12-18 16:49:08,690 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 24806 transitions. Word has length 55 [2019-12-18 16:49:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:08,690 INFO L462 AbstractCegarLoop]: Abstraction has 7946 states and 24806 transitions. [2019-12-18 16:49:08,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:49:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 24806 transitions. [2019-12-18 16:49:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:49:08,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:08,700 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, 1] [2019-12-18 16:49:08,700 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 2 times [2019-12-18 16:49:08,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:08,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768262967] [2019-12-18 16:49:08,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:49:08,892 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-18 16:49:08,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768262967] [2019-12-18 16:49:08,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:49:08,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:49:08,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914639347] [2019-12-18 16:49:08,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:49:08,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:49:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:49:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:49:08,894 INFO L87 Difference]: Start difference. First operand 7946 states and 24806 transitions. Second operand 11 states. [2019-12-18 16:49:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:49:09,739 INFO L93 Difference]: Finished difference Result 11086 states and 33899 transitions. [2019-12-18 16:49:09,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:49:09,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 16:49:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:49:09,753 INFO L225 Difference]: With dead ends: 11086 [2019-12-18 16:49:09,753 INFO L226 Difference]: Without dead ends: 8624 [2019-12-18 16:49:09,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:49:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8624 states. [2019-12-18 16:49:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8624 to 7580. [2019-12-18 16:49:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7580 states. [2019-12-18 16:49:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7580 states to 7580 states and 23624 transitions. [2019-12-18 16:49:09,873 INFO L78 Accepts]: Start accepts. Automaton has 7580 states and 23624 transitions. Word has length 55 [2019-12-18 16:49:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:49:09,873 INFO L462 AbstractCegarLoop]: Abstraction has 7580 states and 23624 transitions. [2019-12-18 16:49:09,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:49:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7580 states and 23624 transitions. [2019-12-18 16:49:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 16:49:09,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:49:09,881 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, 1] [2019-12-18 16:49:09,882 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:49:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:49:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 3 times [2019-12-18 16:49:09,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:49:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805810603] [2019-12-18 16:49:09,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:49:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:49:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:49:10,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:49:10,003 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:49:10,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t636~0.base_28|) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= |v_ULTIMATE.start_main_~#t636~0.offset_19| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t636~0.base_28|) 0) (= v_~y$w_buff1_used~0_559 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t636~0.base_28| 4) |v_#length_21|) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t636~0.base_28| 1)) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_28|) |v_ULTIMATE.start_main_~#t636~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_34) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_17|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ULTIMATE.start_main_~#t636~0.offset=|v_ULTIMATE.start_main_~#t636~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ULTIMATE.start_main_~#t636~0.base=|v_ULTIMATE.start_main_~#t636~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t638~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t638~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t636~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t636~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t637~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:49:10,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t637~0.base_11|) (= |v_ULTIMATE.start_main_~#t637~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11|) |v_ULTIMATE.start_main_~#t637~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t637~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t637~0.base_11| 0)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, #length, ULTIMATE.start_main_~#t637~0.base] because there is no mapped edge [2019-12-18 16:49:10,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t638~0.base_11|)) (= |v_ULTIMATE.start_main_~#t638~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t638~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11|) |v_ULTIMATE.start_main_~#t638~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t638~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t638~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t638~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:49:10,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1_#in~arg.base_In-440368594| P1Thread1of1ForFork1_~arg.base_Out-440368594) (= ~y$w_buff0_used~0_Out-440368594 1) (= |P1Thread1of1ForFork1_#in~arg.offset_In-440368594| P1Thread1of1ForFork1_~arg.offset_Out-440368594) (= ~y$w_buff1_used~0_Out-440368594 ~y$w_buff0_used~0_In-440368594) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-440368594|) (= 1 ~y$w_buff0~0_Out-440368594) (= ~y$w_buff0~0_In-440368594 ~y$w_buff1~0_Out-440368594) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-440368594 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-440368594|) (= (mod ~y$w_buff1_used~0_Out-440368594 256) 0)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-440368594, ~y$w_buff0~0=~y$w_buff0~0_In-440368594, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-440368594|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-440368594|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-440368594, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-440368594, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-440368594, ~y$w_buff1~0=~y$w_buff1~0_Out-440368594, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-440368594|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-440368594, ~y$w_buff0~0=~y$w_buff0~0_Out-440368594, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-440368594|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-440368594|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-440368594} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:49:10,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In217484870 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In217484870 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out217484870| |P2Thread1of1ForFork2_#t~ite33_Out217484870|))) (or (and (= |P2Thread1of1ForFork2_#t~ite32_Out217484870| ~y~0_In217484870) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out217484870| ~y$w_buff1~0_In217484870) .cse2))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In217484870, ~y$w_buff1~0=~y$w_buff1~0_In217484870, ~y~0=~y~0_In217484870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In217484870} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In217484870, ~y$w_buff1~0=~y$w_buff1~0_In217484870, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out217484870|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out217484870|, ~y~0=~y~0_In217484870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In217484870} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 16:49:10,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1035318861 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1035318861 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1035318861| ~y$w_buff0_used~0_In1035318861)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1035318861| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1035318861, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1035318861} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1035318861, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1035318861, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1035318861|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:49:10,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1108302590 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1108302590 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1108302590 |P2Thread1of1ForFork2_#t~ite34_Out-1108302590|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1108302590|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108302590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1108302590} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1108302590|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108302590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1108302590} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 16:49:10,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1422684360 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1422684360 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1422684360 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1422684360 256)))) (or (and (= ~y$w_buff1_used~0_In1422684360 |P2Thread1of1ForFork2_#t~ite35_Out1422684360|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out1422684360| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1422684360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1422684360, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1422684360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1422684360} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1422684360|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1422684360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1422684360, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1422684360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1422684360} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 16:49:10,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-385052297 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-385052297 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite36_Out-385052297| ~y$r_buff0_thd3~0_In-385052297) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out-385052297| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-385052297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-385052297} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-385052297|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-385052297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-385052297} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 16:49:10,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1165407166 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1165407166 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1165407166 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1165407166 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out1165407166|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite37_Out1165407166| ~y$r_buff1_thd3~0_In1165407166)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1165407166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1165407166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1165407166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1165407166} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out1165407166|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1165407166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1165407166, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1165407166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1165407166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 16:49:10,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 16:49:10,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1022331374 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1022331374 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1022331374 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1022331374 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1022331374| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-1022331374| ~y$w_buff1_used~0_In-1022331374)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1022331374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1022331374, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1022331374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022331374} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1022331374, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1022331374|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1022331374, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1022331374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022331374} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 16:49:10,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2046881407 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2046881407 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In2046881407 ~y$r_buff0_thd2~0_Out2046881407) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out2046881407) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2046881407, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2046881407} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2046881407|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2046881407, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out2046881407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:49:10,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In760582741 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In760582741 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In760582741 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In760582741 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out760582741| ~y$r_buff1_thd2~0_In760582741)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out760582741|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760582741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760582741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760582741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760582741} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760582741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760582741, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out760582741|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760582741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760582741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 16:49:10,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 16:49:10,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In809577766 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out809577766| |P0Thread1of1ForFork0_#t~ite8_Out809577766|) (= |P0Thread1of1ForFork0_#t~ite8_Out809577766| ~y$w_buff0~0_In809577766) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In809577766 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd1~0_In809577766 256) 0)) (= (mod ~y$w_buff0_used~0_In809577766 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In809577766 256) 0))))) (and (= |P0Thread1of1ForFork0_#t~ite8_In809577766| |P0Thread1of1ForFork0_#t~ite8_Out809577766|) (= |P0Thread1of1ForFork0_#t~ite9_Out809577766| ~y$w_buff0~0_In809577766) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In809577766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In809577766, ~y$w_buff0~0=~y$w_buff0~0_In809577766, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In809577766, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In809577766|, ~weak$$choice2~0=~weak$$choice2~0_In809577766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In809577766} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In809577766, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out809577766|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In809577766, ~y$w_buff0~0=~y$w_buff0~0_In809577766, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out809577766|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In809577766, ~weak$$choice2~0=~weak$$choice2~0_In809577766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In809577766} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:49:10,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1293201929 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-1293201929| |P0Thread1of1ForFork0_#t~ite11_Out-1293201929|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1293201929 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1293201929 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1293201929 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1293201929 256) 0)))) (= ~y$w_buff1~0_In-1293201929 |P0Thread1of1ForFork0_#t~ite11_Out-1293201929|) .cse1) (and (= ~y$w_buff1~0_In-1293201929 |P0Thread1of1ForFork0_#t~ite12_Out-1293201929|) (= |P0Thread1of1ForFork0_#t~ite11_In-1293201929| |P0Thread1of1ForFork0_#t~ite11_Out-1293201929|) (not .cse1)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1293201929|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1293201929, ~y$w_buff1~0=~y$w_buff1~0_In-1293201929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293201929, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1293201929, ~weak$$choice2~0=~weak$$choice2~0_In-1293201929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293201929} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1293201929|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1293201929, ~y$w_buff1~0=~y$w_buff1~0_In-1293201929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293201929, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1293201929, ~weak$$choice2~0=~weak$$choice2~0_In-1293201929, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1293201929|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293201929} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 16:49:10,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 16:49:10,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 16:49:10,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:49:10,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1598890459 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1598890459 256)))) (or (and (= ~y$w_buff1~0_In1598890459 |ULTIMATE.start_main_#t~ite41_Out1598890459|) (not .cse0) (not .cse1)) (and (= ~y~0_In1598890459 |ULTIMATE.start_main_#t~ite41_Out1598890459|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1598890459, ~y~0=~y~0_In1598890459, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1598890459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598890459} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1598890459|, ~y$w_buff1~0=~y$w_buff1~0_In1598890459, ~y~0=~y~0_In1598890459, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1598890459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598890459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 16:49:10,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:49:10,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-365828432 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-365828432 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-365828432|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-365828432 |ULTIMATE.start_main_#t~ite43_Out-365828432|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-365828432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-365828432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-365828432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-365828432, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-365828432|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:49:10,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-846260952 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-846260952 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-846260952 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-846260952 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-846260952| ~y$w_buff1_used~0_In-846260952) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out-846260952| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-846260952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-846260952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-846260952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846260952} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-846260952, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-846260952, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-846260952, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-846260952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846260952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:49:10,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In512117866 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In512117866 256)))) (or (and (= ~y$r_buff0_thd0~0_In512117866 |ULTIMATE.start_main_#t~ite45_Out512117866|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out512117866|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512117866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512117866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In512117866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512117866, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out512117866|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:49:10,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-905814144 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-905814144 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-905814144 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-905814144 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-905814144 |ULTIMATE.start_main_#t~ite46_Out-905814144|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-905814144|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-905814144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-905814144, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-905814144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905814144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-905814144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-905814144, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-905814144|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-905814144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-905814144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:49:10,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:49:10,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:49:10 BasicIcfg [2019-12-18 16:49:10,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:49:10,107 INFO L168 Benchmark]: Toolchain (without parser) took 49728.38 ms. Allocated memory was 144.7 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 100.2 MB in the beginning and 914.3 MB in the end (delta: -814.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,107 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.60 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,109 INFO L168 Benchmark]: Boogie Preprocessor took 39.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,110 INFO L168 Benchmark]: RCFGBuilder took 874.72 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,110 INFO L168 Benchmark]: TraceAbstraction took 47991.87 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 103.0 MB in the beginning and 914.3 MB in the end (delta: -811.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 16:49:10,114 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.37 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.60 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.72 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47991.87 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 103.0 MB in the beginning and 914.3 MB in the end (delta: -811.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3582 SDtfs, 5155 SDslu, 9933 SDs, 0 SdLazy, 4041 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 16.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 98302 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 126045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...