/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:44:55,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:44:55,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:44:55,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:44:55,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:44:55,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:44:55,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:44:55,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:44:55,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:44:55,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:44:55,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:44:55,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:44:55,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:44:55,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:44:55,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:44:55,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:44:55,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:44:55,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:44:55,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:44:55,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:44:55,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:44:55,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:44:55,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:44:55,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:44:55,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:44:55,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:44:55,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:44:55,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:44:55,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:44:55,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:44:55,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:44:55,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:44:55,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:44:55,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:44:55,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:44:55,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:44:55,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:44:55,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:44:55,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:44:55,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:44:55,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:44:55,167 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-VariableLbe.epf [2019-12-18 21:44:55,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:44:55,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:44:55,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:44:55,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:44:55,202 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:44:55,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:44:55,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:44:55,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:44:55,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:44:55,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:44:55,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:44:55,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:44:55,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:44:55,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:44:55,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:44:55,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:44:55,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:44:55,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:44:55,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:44:55,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:44:55,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:44:55,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:44:55,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:44:55,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:44:55,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:44:55,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:44:55,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:44:55,212 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:44:55,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:44:55,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:44:55,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:44:55,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:44:55,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:44:55,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:44:55,506 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:44:55,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 21:44:55,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e6628c12/38d73c15dfa44faab4b470b69d77c28d/FLAGcc457243c [2019-12-18 21:44:56,111 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:44:56,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 21:44:56,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e6628c12/38d73c15dfa44faab4b470b69d77c28d/FLAGcc457243c [2019-12-18 21:44:56,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e6628c12/38d73c15dfa44faab4b470b69d77c28d [2019-12-18 21:44:56,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:44:56,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:44:56,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:44:56,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:44:56,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:44:56,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:44:56" (1/1) ... [2019-12-18 21:44:56,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80831cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:56, skipping insertion in model container [2019-12-18 21:44:56,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:44:56" (1/1) ... [2019-12-18 21:44:56,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:44:56,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:44:57,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:44:57,056 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:44:57,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:44:57,207 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:44:57,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57 WrapperNode [2019-12-18 21:44:57,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:44:57,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:44:57,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:44:57,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:44:57,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:44:57,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:44:57,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:44:57,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:44:57,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (1/1) ... [2019-12-18 21:44:57,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:44:57,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:44:57,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:44:57,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:44:57,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (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 21:44:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:44:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:44:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:44:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:44:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:44:57,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:44:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:44:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:44:57,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:44:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:44:57,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:44:57,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:44:57,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:44:57,379 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 21:44:58,145 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:44:58,146 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:44:58,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:44:58 BoogieIcfgContainer [2019-12-18 21:44:58,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:44:58,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:44:58,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:44:58,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:44:58,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:44:56" (1/3) ... [2019-12-18 21:44:58,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716bcb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:44:58, skipping insertion in model container [2019-12-18 21:44:58,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:44:57" (2/3) ... [2019-12-18 21:44:58,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716bcb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:44:58, skipping insertion in model container [2019-12-18 21:44:58,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:44:58" (3/3) ... [2019-12-18 21:44:58,158 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc.i [2019-12-18 21:44:58,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:44:58,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:44:58,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:44:58,181 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:44:58,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,316 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,321 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:44:58,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:44:58,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:44:58,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:44:58,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:44:58,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:44:58,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:44:58,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:44:58,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:44:58,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:44:58,383 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 21:44:58,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 21:44:58,473 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 21:44:58,474 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:44:58,492 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:44:58,522 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 21:44:58,574 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 21:44:58,574 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:44:58,585 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:44:58,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:44:58,609 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:45:02,375 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 21:45:02,507 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 21:45:02,540 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-18 21:45:02,540 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 21:45:02,543 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 21:45:18,757 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-18 21:45:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-18 21:45:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:45:18,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:18,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:45:18,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-18 21:45:18,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:18,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357710570] [2019-12-18 21:45:18,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:18,984 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 21:45:18,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357710570] [2019-12-18 21:45:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:45:18,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049462908] [2019-12-18 21:45:18,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:18,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:19,011 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-18 21:45:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:22,989 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-18 21:45:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:22,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:45:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:23,728 INFO L225 Difference]: With dead ends: 106230 [2019-12-18 21:45:23,728 INFO L226 Difference]: Without dead ends: 99639 [2019-12-18 21:45:23,729 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 21:45:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-18 21:45:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-18 21:45:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-18 21:45:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-18 21:45:33,468 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-18 21:45:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-18 21:45:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-18 21:45:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:45:33,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:33,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:45:33,473 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:33,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-18 21:45:33,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:33,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191905605] [2019-12-18 21:45:33,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:33,633 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 21:45:33,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191905605] [2019-12-18 21:45:33,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:33,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:33,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27592403] [2019-12-18 21:45:33,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:33,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:33,637 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-18 21:45:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:38,556 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-18 21:45:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:45:38,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:45:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:39,173 INFO L225 Difference]: With dead ends: 159197 [2019-12-18 21:45:39,173 INFO L226 Difference]: Without dead ends: 159148 [2019-12-18 21:45:39,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:45:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-18 21:45:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-18 21:45:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-18 21:45:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-18 21:45:47,857 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-18 21:45:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:47,857 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-18 21:45:47,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-18 21:45:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:45:47,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:47,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:45:47,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-18 21:45:47,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:47,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570457378] [2019-12-18 21:45:47,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:47,955 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 21:45:47,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570457378] [2019-12-18 21:45:47,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:47,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:47,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731313252] [2019-12-18 21:45:47,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:47,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:47,958 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-18 21:45:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:48,113 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-18 21:45:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:48,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:45:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:48,176 INFO L225 Difference]: With dead ends: 32092 [2019-12-18 21:45:48,176 INFO L226 Difference]: Without dead ends: 32092 [2019-12-18 21:45:48,177 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 21:45:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-18 21:45:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-18 21:45:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-18 21:45:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-18 21:45:53,367 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-18 21:45:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:53,367 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-18 21:45:53,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-18 21:45:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:45:53,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:53,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:45:53,371 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-18 21:45:53,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:53,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51444444] [2019-12-18 21:45:53,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:53,463 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 21:45:53,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51444444] [2019-12-18 21:45:53,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:53,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:45:53,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019572641] [2019-12-18 21:45:53,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:45:53,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:45:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:45:53,465 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-18 21:45:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:53,999 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-18 21:45:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:45:54,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:45:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:54,088 INFO L225 Difference]: With dead ends: 43827 [2019-12-18 21:45:54,089 INFO L226 Difference]: Without dead ends: 43827 [2019-12-18 21:45:54,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:45:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-18 21:45:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-18 21:45:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-18 21:45:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-18 21:45:55,107 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-18 21:45:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:55,108 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-18 21:45:55,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:45:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-18 21:45:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:45:55,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:55,118 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 21:45:55,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-18 21:45:55,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:55,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979162204] [2019-12-18 21:45:55,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:55,279 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 21:45:55,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979162204] [2019-12-18 21:45:55,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:55,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:45:55,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888200739] [2019-12-18 21:45:55,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:45:55,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:45:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:45:55,281 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-18 21:45:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:56,387 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-18 21:45:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:45:56,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:45:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:56,484 INFO L225 Difference]: With dead ends: 56855 [2019-12-18 21:45:56,484 INFO L226 Difference]: Without dead ends: 56848 [2019-12-18 21:45:56,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:45:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-18 21:45:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-18 21:45:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-18 21:45:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-18 21:45:57,623 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-18 21:45:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:57,624 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-18 21:45:57,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:45:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-18 21:45:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:45:57,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:57,639 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 21:45:57,639 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-18 21:45:57,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:57,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992895645] [2019-12-18 21:45:57,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:57,696 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 21:45:57,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992895645] [2019-12-18 21:45:57,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:57,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:45:57,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347044212] [2019-12-18 21:45:57,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:57,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:57,698 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-18 21:45:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:57,760 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-18 21:45:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:45:57,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:45:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:57,782 INFO L225 Difference]: With dead ends: 15569 [2019-12-18 21:45:57,782 INFO L226 Difference]: Without dead ends: 15569 [2019-12-18 21:45:57,782 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 21:45:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-18 21:45:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-18 21:45:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 21:45:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-18 21:45:57,998 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-18 21:45:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:57,998 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-18 21:45:57,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:45:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-18 21:45:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:45:58,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:58,011 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] [2019-12-18 21:45:58,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-18 21:45:58,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:58,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330439693] [2019-12-18 21:45:58,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:58,165 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 21:45:58,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330439693] [2019-12-18 21:45:58,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:58,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:45:58,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414983074] [2019-12-18 21:45:58,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:45:58,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:45:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:45:58,168 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 8 states. [2019-12-18 21:45:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:59,005 INFO L93 Difference]: Finished difference Result 20385 states and 60642 transitions. [2019-12-18 21:45:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:45:59,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-18 21:45:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:59,044 INFO L225 Difference]: With dead ends: 20385 [2019-12-18 21:45:59,044 INFO L226 Difference]: Without dead ends: 20385 [2019-12-18 21:45:59,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:45:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2019-12-18 21:45:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 17627. [2019-12-18 21:45:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-18 21:45:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-18 21:45:59,435 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-18 21:45:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:59,437 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-18 21:45:59,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:45:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-18 21:45:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:45:59,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:59,464 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] [2019-12-18 21:45:59,464 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:45:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-18 21:45:59,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:59,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387088979] [2019-12-18 21:45:59,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:59,872 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-18 21:45:59,914 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 21:45:59,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387088979] [2019-12-18 21:45:59,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:45:59,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551494706] [2019-12-18 21:45:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:45:59,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:45:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:45:59,917 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-18 21:46:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:01,204 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-18 21:46:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:46:01,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:46:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:01,239 INFO L225 Difference]: With dead ends: 24877 [2019-12-18 21:46:01,239 INFO L226 Difference]: Without dead ends: 24877 [2019-12-18 21:46:01,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:46:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-18 21:46:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-18 21:46:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 21:46:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-18 21:46:01,555 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-18 21:46:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:01,556 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-18 21:46:01,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-18 21:46:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:46:01,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:01,580 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 21:46:01,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-18 21:46:01,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:01,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31662825] [2019-12-18 21:46:01,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:01,665 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 21:46:01,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31662825] [2019-12-18 21:46:01,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:01,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:46:01,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228442989] [2019-12-18 21:46:01,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:01,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:01,667 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 5 states. [2019-12-18 21:46:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:02,349 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-18 21:46:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:46:02,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:46:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:02,380 INFO L225 Difference]: With dead ends: 23664 [2019-12-18 21:46:02,380 INFO L226 Difference]: Without dead ends: 23664 [2019-12-18 21:46:02,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:46:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-18 21:46:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-18 21:46:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-18 21:46:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-18 21:46:02,697 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-18 21:46:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:02,697 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-18 21:46:02,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-18 21:46:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:46:02,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:02,731 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 21:46:02,731 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-18 21:46:02,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:02,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452714385] [2019-12-18 21:46:02,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:03,097 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-12-18 21:46:03,105 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 21:46:03,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452714385] [2019-12-18 21:46:03,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:03,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:03,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134664483] [2019-12-18 21:46:03,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:03,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:03,107 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 3 states. [2019-12-18 21:46:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:03,205 INFO L93 Difference]: Finished difference Result 22129 states and 66391 transitions. [2019-12-18 21:46:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:46:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:03,252 INFO L225 Difference]: With dead ends: 22129 [2019-12-18 21:46:03,252 INFO L226 Difference]: Without dead ends: 22129 [2019-12-18 21:46:03,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22129 states. [2019-12-18 21:46:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22129 to 19000. [2019-12-18 21:46:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19000 states. [2019-12-18 21:46:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19000 states to 19000 states and 57697 transitions. [2019-12-18 21:46:03,657 INFO L78 Accepts]: Start accepts. Automaton has 19000 states and 57697 transitions. Word has length 39 [2019-12-18 21:46:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:03,657 INFO L462 AbstractCegarLoop]: Abstraction has 19000 states and 57697 transitions. [2019-12-18 21:46:03,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19000 states and 57697 transitions. [2019-12-18 21:46:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:46:03,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:03,677 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] [2019-12-18 21:46:03,677 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1052140234, now seen corresponding path program 1 times [2019-12-18 21:46:03,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:03,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892886568] [2019-12-18 21:46:03,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:03,728 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 21:46:03,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892886568] [2019-12-18 21:46:03,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:03,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:03,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156460573] [2019-12-18 21:46:03,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:03,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:03,730 INFO L87 Difference]: Start difference. First operand 19000 states and 57697 transitions. Second operand 5 states. [2019-12-18 21:46:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:03,809 INFO L93 Difference]: Finished difference Result 17811 states and 55053 transitions. [2019-12-18 21:46:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:46:03,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:46:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:03,834 INFO L225 Difference]: With dead ends: 17811 [2019-12-18 21:46:03,835 INFO L226 Difference]: Without dead ends: 17811 [2019-12-18 21:46:03,835 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 21:46:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17811 states. [2019-12-18 21:46:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17811 to 17811. [2019-12-18 21:46:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17811 states. [2019-12-18 21:46:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17811 states to 17811 states and 55053 transitions. [2019-12-18 21:46:04,079 INFO L78 Accepts]: Start accepts. Automaton has 17811 states and 55053 transitions. Word has length 40 [2019-12-18 21:46:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:04,079 INFO L462 AbstractCegarLoop]: Abstraction has 17811 states and 55053 transitions. [2019-12-18 21:46:04,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17811 states and 55053 transitions. [2019-12-18 21:46:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:04,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:04,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:04,098 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1026974969, now seen corresponding path program 1 times [2019-12-18 21:46:04,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:04,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612762077] [2019-12-18 21:46:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:04,151 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 21:46:04,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612762077] [2019-12-18 21:46:04,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:04,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:04,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625333806] [2019-12-18 21:46:04,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:04,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:04,154 INFO L87 Difference]: Start difference. First operand 17811 states and 55053 transitions. Second operand 3 states. [2019-12-18 21:46:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:04,291 INFO L93 Difference]: Finished difference Result 25549 states and 79388 transitions. [2019-12-18 21:46:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:04,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:46:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:04,334 INFO L225 Difference]: With dead ends: 25549 [2019-12-18 21:46:04,335 INFO L226 Difference]: Without dead ends: 25549 [2019-12-18 21:46:04,335 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 21:46:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25549 states. [2019-12-18 21:46:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25549 to 20120. [2019-12-18 21:46:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20120 states. [2019-12-18 21:46:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20120 states to 20120 states and 63063 transitions. [2019-12-18 21:46:04,679 INFO L78 Accepts]: Start accepts. Automaton has 20120 states and 63063 transitions. Word has length 65 [2019-12-18 21:46:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:04,680 INFO L462 AbstractCegarLoop]: Abstraction has 20120 states and 63063 transitions. [2019-12-18 21:46:04,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20120 states and 63063 transitions. [2019-12-18 21:46:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:04,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:04,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:04,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1733622222, now seen corresponding path program 1 times [2019-12-18 21:46:04,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:04,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771009974] [2019-12-18 21:46:04,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:04,774 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 21:46:04,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771009974] [2019-12-18 21:46:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:04,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045501846] [2019-12-18 21:46:04,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:04,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:04,776 INFO L87 Difference]: Start difference. First operand 20120 states and 63063 transitions. Second operand 4 states. [2019-12-18 21:46:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:05,150 INFO L93 Difference]: Finished difference Result 37559 states and 118042 transitions. [2019-12-18 21:46:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:05,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:46:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:05,188 INFO L225 Difference]: With dead ends: 37559 [2019-12-18 21:46:05,189 INFO L226 Difference]: Without dead ends: 18722 [2019-12-18 21:46:05,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:46:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18722 states. [2019-12-18 21:46:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18722 to 18722. [2019-12-18 21:46:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18722 states. [2019-12-18 21:46:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18722 states to 18722 states and 58625 transitions. [2019-12-18 21:46:05,455 INFO L78 Accepts]: Start accepts. Automaton has 18722 states and 58625 transitions. Word has length 65 [2019-12-18 21:46:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:05,455 INFO L462 AbstractCegarLoop]: Abstraction has 18722 states and 58625 transitions. [2019-12-18 21:46:05,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18722 states and 58625 transitions. [2019-12-18 21:46:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:05,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:05,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:05,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1337551254, now seen corresponding path program 2 times [2019-12-18 21:46:05,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:05,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869945444] [2019-12-18 21:46:05,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:05,573 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 21:46:05,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869945444] [2019-12-18 21:46:05,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:05,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:05,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494197154] [2019-12-18 21:46:05,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:05,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:05,576 INFO L87 Difference]: Start difference. First operand 18722 states and 58625 transitions. Second operand 7 states. [2019-12-18 21:46:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:06,276 INFO L93 Difference]: Finished difference Result 52949 states and 164387 transitions. [2019-12-18 21:46:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:46:06,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:46:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:06,375 INFO L225 Difference]: With dead ends: 52949 [2019-12-18 21:46:06,375 INFO L226 Difference]: Without dead ends: 36830 [2019-12-18 21:46:06,376 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 21:46:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36830 states. [2019-12-18 21:46:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36830 to 21717. [2019-12-18 21:46:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21717 states. [2019-12-18 21:46:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21717 states to 21717 states and 67798 transitions. [2019-12-18 21:46:07,048 INFO L78 Accepts]: Start accepts. Automaton has 21717 states and 67798 transitions. Word has length 65 [2019-12-18 21:46:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:07,049 INFO L462 AbstractCegarLoop]: Abstraction has 21717 states and 67798 transitions. [2019-12-18 21:46:07,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21717 states and 67798 transitions. [2019-12-18 21:46:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:07,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:07,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:07,076 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1390870140, now seen corresponding path program 3 times [2019-12-18 21:46:07,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:07,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496808697] [2019-12-18 21:46:07,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:07,161 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 21:46:07,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496808697] [2019-12-18 21:46:07,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:07,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:07,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117294113] [2019-12-18 21:46:07,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:07,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:07,163 INFO L87 Difference]: Start difference. First operand 21717 states and 67798 transitions. Second operand 7 states. [2019-12-18 21:46:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:08,202 INFO L93 Difference]: Finished difference Result 61103 states and 190649 transitions. [2019-12-18 21:46:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:46:08,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:46:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:08,314 INFO L225 Difference]: With dead ends: 61103 [2019-12-18 21:46:08,314 INFO L226 Difference]: Without dead ends: 46500 [2019-12-18 21:46:08,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:46:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46500 states. [2019-12-18 21:46:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46500 to 25844. [2019-12-18 21:46:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25844 states. [2019-12-18 21:46:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25844 states to 25844 states and 81113 transitions. [2019-12-18 21:46:09,124 INFO L78 Accepts]: Start accepts. Automaton has 25844 states and 81113 transitions. Word has length 65 [2019-12-18 21:46:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 25844 states and 81113 transitions. [2019-12-18 21:46:09,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 25844 states and 81113 transitions. [2019-12-18 21:46:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:09,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:09,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:09,158 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash -277663810, now seen corresponding path program 4 times [2019-12-18 21:46:09,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:09,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219099363] [2019-12-18 21:46:09,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:09,239 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 21:46:09,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219099363] [2019-12-18 21:46:09,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:09,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:09,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010189730] [2019-12-18 21:46:09,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:09,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:09,243 INFO L87 Difference]: Start difference. First operand 25844 states and 81113 transitions. Second operand 7 states. [2019-12-18 21:46:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:09,733 INFO L93 Difference]: Finished difference Result 53291 states and 165701 transitions. [2019-12-18 21:46:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:46:09,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:46:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:09,820 INFO L225 Difference]: With dead ends: 53291 [2019-12-18 21:46:09,820 INFO L226 Difference]: Without dead ends: 46524 [2019-12-18 21:46:09,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:46:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46524 states. [2019-12-18 21:46:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46524 to 26152. [2019-12-18 21:46:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26152 states. [2019-12-18 21:46:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26152 states to 26152 states and 82064 transitions. [2019-12-18 21:46:10,842 INFO L78 Accepts]: Start accepts. Automaton has 26152 states and 82064 transitions. Word has length 65 [2019-12-18 21:46:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:10,842 INFO L462 AbstractCegarLoop]: Abstraction has 26152 states and 82064 transitions. [2019-12-18 21:46:10,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26152 states and 82064 transitions. [2019-12-18 21:46:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:10,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:10,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:10,871 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -583895350, now seen corresponding path program 5 times [2019-12-18 21:46:10,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:10,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639237968] [2019-12-18 21:46:10,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:10,938 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 21:46:10,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639237968] [2019-12-18 21:46:10,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:10,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:10,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748946293] [2019-12-18 21:46:10,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:10,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:10,940 INFO L87 Difference]: Start difference. First operand 26152 states and 82064 transitions. Second operand 3 states. [2019-12-18 21:46:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:11,120 INFO L93 Difference]: Finished difference Result 30328 states and 94725 transitions. [2019-12-18 21:46:11,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:11,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:46:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:11,167 INFO L225 Difference]: With dead ends: 30328 [2019-12-18 21:46:11,168 INFO L226 Difference]: Without dead ends: 30328 [2019-12-18 21:46:11,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:46:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-18 21:46:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 26746. [2019-12-18 21:46:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26746 states. [2019-12-18 21:46:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26746 states to 26746 states and 84221 transitions. [2019-12-18 21:46:11,653 INFO L78 Accepts]: Start accepts. Automaton has 26746 states and 84221 transitions. Word has length 65 [2019-12-18 21:46:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:11,653 INFO L462 AbstractCegarLoop]: Abstraction has 26746 states and 84221 transitions. [2019-12-18 21:46:11,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 26746 states and 84221 transitions. [2019-12-18 21:46:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:11,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:11,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:11,684 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1873623170, now seen corresponding path program 1 times [2019-12-18 21:46:11,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:11,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649900462] [2019-12-18 21:46:11,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:11,741 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 21:46:11,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649900462] [2019-12-18 21:46:11,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:11,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:11,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782459122] [2019-12-18 21:46:11,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:11,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:11,747 INFO L87 Difference]: Start difference. First operand 26746 states and 84221 transitions. Second operand 4 states. [2019-12-18 21:46:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:12,078 INFO L93 Difference]: Finished difference Result 32355 states and 101072 transitions. [2019-12-18 21:46:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:12,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:46:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:12,143 INFO L225 Difference]: With dead ends: 32355 [2019-12-18 21:46:12,144 INFO L226 Difference]: Without dead ends: 32355 [2019-12-18 21:46:12,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:46:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32355 states. [2019-12-18 21:46:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32355 to 27141. [2019-12-18 21:46:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27141 states. [2019-12-18 21:46:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27141 states to 27141 states and 85560 transitions. [2019-12-18 21:46:12,698 INFO L78 Accepts]: Start accepts. Automaton has 27141 states and 85560 transitions. Word has length 66 [2019-12-18 21:46:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:12,699 INFO L462 AbstractCegarLoop]: Abstraction has 27141 states and 85560 transitions. [2019-12-18 21:46:12,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27141 states and 85560 transitions. [2019-12-18 21:46:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:12,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:12,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:12,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1016991850, now seen corresponding path program 2 times [2019-12-18 21:46:12,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:12,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846177454] [2019-12-18 21:46:12,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:12,780 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 21:46:12,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846177454] [2019-12-18 21:46:12,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:12,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:12,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156091242] [2019-12-18 21:46:12,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:12,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:12,782 INFO L87 Difference]: Start difference. First operand 27141 states and 85560 transitions. Second operand 4 states. [2019-12-18 21:46:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:13,393 INFO L93 Difference]: Finished difference Result 42106 states and 133039 transitions. [2019-12-18 21:46:13,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:46:13,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:46:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:13,460 INFO L225 Difference]: With dead ends: 42106 [2019-12-18 21:46:13,460 INFO L226 Difference]: Without dead ends: 42106 [2019-12-18 21:46:13,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 21:46:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42106 states. [2019-12-18 21:46:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42106 to 29300. [2019-12-18 21:46:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-18 21:46:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 93345 transitions. [2019-12-18 21:46:14,048 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 93345 transitions. Word has length 66 [2019-12-18 21:46:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:14,048 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 93345 transitions. [2019-12-18 21:46:14,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 93345 transitions. [2019-12-18 21:46:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:14,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:14,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:14,083 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash 313379346, now seen corresponding path program 3 times [2019-12-18 21:46:14,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:14,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272745602] [2019-12-18 21:46:14,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:14,162 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 21:46:14,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272745602] [2019-12-18 21:46:14,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:14,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:14,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674275886] [2019-12-18 21:46:14,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:14,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:14,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:14,165 INFO L87 Difference]: Start difference. First operand 29300 states and 93345 transitions. Second operand 7 states. [2019-12-18 21:46:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:14,673 INFO L93 Difference]: Finished difference Result 63173 states and 198893 transitions. [2019-12-18 21:46:14,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:46:14,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 21:46:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:14,764 INFO L225 Difference]: With dead ends: 63173 [2019-12-18 21:46:14,764 INFO L226 Difference]: Without dead ends: 57661 [2019-12-18 21:46:14,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:46:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57661 states. [2019-12-18 21:46:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57661 to 29332. [2019-12-18 21:46:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29332 states. [2019-12-18 21:46:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29332 states to 29332 states and 93463 transitions. [2019-12-18 21:46:15,930 INFO L78 Accepts]: Start accepts. Automaton has 29332 states and 93463 transitions. Word has length 66 [2019-12-18 21:46:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:15,931 INFO L462 AbstractCegarLoop]: Abstraction has 29332 states and 93463 transitions. [2019-12-18 21:46:15,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29332 states and 93463 transitions. [2019-12-18 21:46:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:15,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:15,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:15,969 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 521773570, now seen corresponding path program 4 times [2019-12-18 21:46:15,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:15,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403570915] [2019-12-18 21:46:15,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:16,069 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 21:46:16,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403570915] [2019-12-18 21:46:16,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:16,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:46:16,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036233953] [2019-12-18 21:46:16,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:16,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:16,071 INFO L87 Difference]: Start difference. First operand 29332 states and 93463 transitions. Second operand 7 states. [2019-12-18 21:46:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:16,708 INFO L93 Difference]: Finished difference Result 47421 states and 152018 transitions. [2019-12-18 21:46:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:46:16,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 21:46:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:16,785 INFO L225 Difference]: With dead ends: 47421 [2019-12-18 21:46:16,785 INFO L226 Difference]: Without dead ends: 47421 [2019-12-18 21:46:16,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:46:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47421 states. [2019-12-18 21:46:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47421 to 30552. [2019-12-18 21:46:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30552 states. [2019-12-18 21:46:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30552 states to 30552 states and 97174 transitions. [2019-12-18 21:46:17,443 INFO L78 Accepts]: Start accepts. Automaton has 30552 states and 97174 transitions. Word has length 66 [2019-12-18 21:46:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:17,444 INFO L462 AbstractCegarLoop]: Abstraction has 30552 states and 97174 transitions. [2019-12-18 21:46:17,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30552 states and 97174 transitions. [2019-12-18 21:46:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:17,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:17,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:17,484 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-18 21:46:17,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:17,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941550929] [2019-12-18 21:46:17,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:17,695 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 21:46:17,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941550929] [2019-12-18 21:46:17,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:17,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:46:17,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466199641] [2019-12-18 21:46:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:46:17,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:46:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:46:17,703 INFO L87 Difference]: Start difference. First operand 30552 states and 97174 transitions. Second operand 11 states. [2019-12-18 21:46:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:20,435 INFO L93 Difference]: Finished difference Result 51987 states and 161094 transitions. [2019-12-18 21:46:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:46:20,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:46:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:20,510 INFO L225 Difference]: With dead ends: 51987 [2019-12-18 21:46:20,510 INFO L226 Difference]: Without dead ends: 51868 [2019-12-18 21:46:20,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:46:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51868 states. [2019-12-18 21:46:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51868 to 33844. [2019-12-18 21:46:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33844 states. [2019-12-18 21:46:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33844 states to 33844 states and 107658 transitions. [2019-12-18 21:46:21,201 INFO L78 Accepts]: Start accepts. Automaton has 33844 states and 107658 transitions. Word has length 66 [2019-12-18 21:46:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:21,201 INFO L462 AbstractCegarLoop]: Abstraction has 33844 states and 107658 transitions. [2019-12-18 21:46:21,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:46:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33844 states and 107658 transitions. [2019-12-18 21:46:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:21,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:21,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:21,243 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-18 21:46:21,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:21,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329387552] [2019-12-18 21:46:21,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:21,307 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 21:46:21,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329387552] [2019-12-18 21:46:21,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:21,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:21,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425412746] [2019-12-18 21:46:21,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:21,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:21,310 INFO L87 Difference]: Start difference. First operand 33844 states and 107658 transitions. Second operand 3 states. [2019-12-18 21:46:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:21,434 INFO L93 Difference]: Finished difference Result 28766 states and 89637 transitions. [2019-12-18 21:46:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:46:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:21,492 INFO L225 Difference]: With dead ends: 28766 [2019-12-18 21:46:21,492 INFO L226 Difference]: Without dead ends: 28766 [2019-12-18 21:46:21,492 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 21:46:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28766 states. [2019-12-18 21:46:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28766 to 27170. [2019-12-18 21:46:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27170 states. [2019-12-18 21:46:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27170 states to 27170 states and 84570 transitions. [2019-12-18 21:46:22,264 INFO L78 Accepts]: Start accepts. Automaton has 27170 states and 84570 transitions. Word has length 66 [2019-12-18 21:46:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:22,264 INFO L462 AbstractCegarLoop]: Abstraction has 27170 states and 84570 transitions. [2019-12-18 21:46:22,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 27170 states and 84570 transitions. [2019-12-18 21:46:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:22,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:22,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:22,326 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1781917276, now seen corresponding path program 1 times [2019-12-18 21:46:22,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:22,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930067603] [2019-12-18 21:46:22,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:22,444 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 21:46:22,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930067603] [2019-12-18 21:46:22,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:22,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144656155] [2019-12-18 21:46:22,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:22,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:22,449 INFO L87 Difference]: Start difference. First operand 27170 states and 84570 transitions. Second operand 4 states. [2019-12-18 21:46:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:22,701 INFO L93 Difference]: Finished difference Result 27170 states and 84336 transitions. [2019-12-18 21:46:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:22,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 21:46:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:22,767 INFO L225 Difference]: With dead ends: 27170 [2019-12-18 21:46:22,767 INFO L226 Difference]: Without dead ends: 27170 [2019-12-18 21:46:22,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:46:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27170 states. [2019-12-18 21:46:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27170 to 23285. [2019-12-18 21:46:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23285 states. [2019-12-18 21:46:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 72077 transitions. [2019-12-18 21:46:23,643 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 72077 transitions. Word has length 67 [2019-12-18 21:46:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:23,644 INFO L462 AbstractCegarLoop]: Abstraction has 23285 states and 72077 transitions. [2019-12-18 21:46:23,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 72077 transitions. [2019-12-18 21:46:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:23,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:23,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:23,680 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-18 21:46:23,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:23,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182562754] [2019-12-18 21:46:23,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:23,889 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 21:46:23,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182562754] [2019-12-18 21:46:23,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:23,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:46:23,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183993060] [2019-12-18 21:46:23,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:46:23,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:46:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:46:23,891 INFO L87 Difference]: Start difference. First operand 23285 states and 72077 transitions. Second operand 12 states. [2019-12-18 21:46:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:25,471 INFO L93 Difference]: Finished difference Result 51378 states and 158051 transitions. [2019-12-18 21:46:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 21:46:25,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:46:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:25,528 INFO L225 Difference]: With dead ends: 51378 [2019-12-18 21:46:25,529 INFO L226 Difference]: Without dead ends: 38048 [2019-12-18 21:46:25,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 21:46:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38048 states. [2019-12-18 21:46:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38048 to 23158. [2019-12-18 21:46:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23158 states. [2019-12-18 21:46:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23158 states to 23158 states and 70852 transitions. [2019-12-18 21:46:25,974 INFO L78 Accepts]: Start accepts. Automaton has 23158 states and 70852 transitions. Word has length 67 [2019-12-18 21:46:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:25,975 INFO L462 AbstractCegarLoop]: Abstraction has 23158 states and 70852 transitions. [2019-12-18 21:46:25,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:46:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23158 states and 70852 transitions. [2019-12-18 21:46:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:26,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:26,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:26,005 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-18 21:46:26,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:26,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638146453] [2019-12-18 21:46:26,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:26,202 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 21:46:26,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638146453] [2019-12-18 21:46:26,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:26,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:46:26,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615337381] [2019-12-18 21:46:26,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:46:26,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:46:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:46:26,204 INFO L87 Difference]: Start difference. First operand 23158 states and 70852 transitions. Second operand 13 states. [2019-12-18 21:46:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:27,302 INFO L93 Difference]: Finished difference Result 38577 states and 116960 transitions. [2019-12-18 21:46:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 21:46:27,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 21:46:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:27,374 INFO L225 Difference]: With dead ends: 38577 [2019-12-18 21:46:27,374 INFO L226 Difference]: Without dead ends: 37769 [2019-12-18 21:46:27,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:46:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37769 states. [2019-12-18 21:46:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37769 to 22628. [2019-12-18 21:46:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22628 states. [2019-12-18 21:46:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22628 states to 22628 states and 69380 transitions. [2019-12-18 21:46:28,126 INFO L78 Accepts]: Start accepts. Automaton has 22628 states and 69380 transitions. Word has length 67 [2019-12-18 21:46:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:28,126 INFO L462 AbstractCegarLoop]: Abstraction has 22628 states and 69380 transitions. [2019-12-18 21:46:28,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:46:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22628 states and 69380 transitions. [2019-12-18 21:46:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:28,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:28,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:28,153 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 3 times [2019-12-18 21:46:28,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:28,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423963110] [2019-12-18 21:46:28,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:46:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:46:28,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:46:28,266 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:46:28,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_23|) |v_ULTIMATE.start_main_~#t1385~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$w_buff1~0_28) (= |v_ULTIMATE.start_main_~#t1385~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= (select .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_23|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_23| 1) |v_#valid_64|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1385~0.base_23|) (= v_~z$r_buff0_thd1~0_22 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1385~0.base_23| 4) |v_#length_23|) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t1385~0.offset=|v_ULTIMATE.start_main_~#t1385~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_22|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_17|, ULTIMATE.start_main_~#t1385~0.base=|v_ULTIMATE.start_main_~#t1385~0.base_23|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1387~0.offset, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1387~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1386~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1385~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1385~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:46:28,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9|) |v_ULTIMATE.start_main_~#t1386~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9| 1)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1386~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1386~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1386~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1386~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_9|, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_~#t1386~0.offset] because there is no mapped edge [2019-12-18 21:46:28,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-106005188| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-106005188) (= ~z$w_buff0_used~0_Out-106005188 1) (= P0Thread1of1ForFork0_~arg.base_Out-106005188 |P0Thread1of1ForFork0_#in~arg.base_In-106005188|) (= ~z$w_buff1~0_Out-106005188 ~z$w_buff0~0_In-106005188) (= 1 ~z$w_buff0~0_Out-106005188) (= 0 (mod ~z$w_buff1_used~0_Out-106005188 256)) (= ~z$w_buff1_used~0_Out-106005188 ~z$w_buff0_used~0_In-106005188) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-106005188| 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In-106005188| P0Thread1of1ForFork0_~arg.offset_Out-106005188)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-106005188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-106005188, ~z$w_buff0~0=~z$w_buff0~0_In-106005188, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-106005188|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-106005188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-106005188, ~z$w_buff0~0=~z$w_buff0~0_Out-106005188, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-106005188, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-106005188, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-106005188|, ~z$w_buff1~0=~z$w_buff1~0_Out-106005188, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-106005188, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-106005188|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-106005188} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:46:28,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1387~0.base_11|) (= |v_ULTIMATE.start_main_~#t1387~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t1387~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11|) |v_ULTIMATE.start_main_~#t1387~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1387~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1387~0.offset, #length, ULTIMATE.start_main_~#t1387~0.base] because there is no mapped edge [2019-12-18 21:46:28,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1086996601 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1086996601 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1086996601| |P1Thread1of1ForFork1_#t~ite10_Out-1086996601|))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1086996601| ~z$w_buff1~0_In-1086996601) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1086996601| ~z~0_In-1086996601)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1086996601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1086996601, ~z$w_buff1~0=~z$w_buff1~0_In-1086996601, ~z~0=~z~0_In-1086996601} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1086996601|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1086996601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1086996601, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1086996601|, ~z$w_buff1~0=~z$w_buff1~0_In-1086996601, ~z~0=~z~0_In-1086996601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 21:46:28,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1586468260 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1586468260 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1586468260| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1586468260| ~z$w_buff0_used~0_In1586468260)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1586468260, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1586468260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1586468260, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1586468260|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1586468260} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:46:28,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1861248417 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1861248417 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1861248417 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1861248417 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1861248417| 0)) (and (= ~z$w_buff1_used~0_In1861248417 |P1Thread1of1ForFork1_#t~ite12_Out1861248417|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1861248417, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1861248417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1861248417, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1861248417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1861248417, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1861248417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1861248417, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1861248417|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1861248417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:46:28,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-594955301 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-594955301 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-594955301|)) (and (= ~z$r_buff0_thd2~0_In-594955301 |P1Thread1of1ForFork1_#t~ite13_Out-594955301|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-594955301, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-594955301} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-594955301, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-594955301|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-594955301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:46:28,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1200219101 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1200219101| |P2Thread1of1ForFork2_#t~ite23_Out-1200219101|) (= ~z$w_buff1~0_In-1200219101 |P2Thread1of1ForFork2_#t~ite23_Out-1200219101|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1200219101 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1200219101 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1200219101 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1200219101 256))))) .cse1) (and (= ~z$w_buff1~0_In-1200219101 |P2Thread1of1ForFork2_#t~ite24_Out-1200219101|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In-1200219101| |P2Thread1of1ForFork2_#t~ite23_Out-1200219101|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1200219101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1200219101, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1200219101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1200219101, ~z$w_buff1~0=~z$w_buff1~0_In-1200219101, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1200219101, ~weak$$choice2~0=~weak$$choice2~0_In-1200219101} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1200219101|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1200219101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1200219101, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1200219101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1200219101, ~z$w_buff1~0=~z$w_buff1~0_In-1200219101, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1200219101, ~weak$$choice2~0=~weak$$choice2~0_In-1200219101} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 21:46:28,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1220838153 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out1220838153| ~z$w_buff0_used~0_In1220838153) (= |P2Thread1of1ForFork2_#t~ite26_In1220838153| |P2Thread1of1ForFork2_#t~ite26_Out1220838153|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out1220838153| |P2Thread1of1ForFork2_#t~ite27_Out1220838153|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1220838153 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1220838153 256)) (and (= (mod ~z$r_buff1_thd3~0_In1220838153 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1220838153 256))))) (= |P2Thread1of1ForFork2_#t~ite26_Out1220838153| ~z$w_buff0_used~0_In1220838153) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1220838153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1220838153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220838153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220838153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220838153, ~weak$$choice2~0=~weak$$choice2~0_In1220838153} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1220838153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1220838153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220838153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220838153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220838153, ~weak$$choice2~0=~weak$$choice2~0_In1220838153, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1220838153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 21:46:28,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1554747328 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1554747328 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1554747328 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1554747328 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1554747328| ~z$r_buff1_thd2~0_In1554747328) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1554747328| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1554747328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1554747328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554747328, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1554747328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1554747328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1554747328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554747328, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1554747328|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1554747328} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:46:28,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:46:28,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-770100584 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-770100584| ~z$w_buff1_used~0_In-770100584) (= |P2Thread1of1ForFork2_#t~ite29_In-770100584| |P2Thread1of1ForFork2_#t~ite29_Out-770100584|) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-770100584 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-770100584 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-770100584 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-770100584 256)))) (= |P2Thread1of1ForFork2_#t~ite29_Out-770100584| ~z$w_buff1_used~0_In-770100584) (= |P2Thread1of1ForFork2_#t~ite30_Out-770100584| |P2Thread1of1ForFork2_#t~ite29_Out-770100584|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-770100584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-770100584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770100584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-770100584, ~weak$$choice2~0=~weak$$choice2~0_In-770100584, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-770100584|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-770100584|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-770100584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-770100584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770100584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-770100584, ~weak$$choice2~0=~weak$$choice2~0_In-770100584, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-770100584|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:46:28,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:46:28,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:46:28,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1261466938 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1261466938 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1261466938| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1261466938| ~z$w_buff0_used~0_In1261466938) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1261466938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1261466938} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1261466938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261466938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1261466938} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:46:28,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1814545197 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1814545197 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1814545197 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1814545197 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1814545197|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1814545197 |P0Thread1of1ForFork0_#t~ite6_Out1814545197|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1814545197, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1814545197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1814545197, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1814545197} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1814545197|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1814545197, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1814545197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1814545197, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1814545197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:46:28,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1897369208 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1897369208 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1897369208 ~z$r_buff0_thd1~0_In1897369208)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd1~0_Out1897369208 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897369208, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1897369208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1897369208, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1897369208|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1897369208} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:46:28,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In116629440 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In116629440 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In116629440 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In116629440 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out116629440|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In116629440 |P0Thread1of1ForFork0_#t~ite8_Out116629440|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In116629440, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In116629440, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116629440, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In116629440} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In116629440, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out116629440|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In116629440, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116629440, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In116629440} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:46:28,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:46:28,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-1359501563| |P2Thread1of1ForFork2_#t~ite38_Out-1359501563|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1359501563 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1359501563 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1359501563| ~z~0_In-1359501563) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-1359501563| ~z$w_buff1~0_In-1359501563)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1359501563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1359501563, ~z$w_buff1~0=~z$w_buff1~0_In-1359501563, ~z~0=~z~0_In-1359501563} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1359501563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1359501563, ~z$w_buff1~0=~z$w_buff1~0_In-1359501563, ~z~0=~z~0_In-1359501563, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1359501563|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1359501563|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 21:46:28,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1202147001 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1202147001 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1202147001|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1202147001 |P2Thread1of1ForFork2_#t~ite40_Out-1202147001|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202147001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1202147001} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202147001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1202147001, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1202147001|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 21:46:28,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1585872093 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1585872093 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1585872093 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1585872093 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1585872093| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1585872093| ~z$w_buff1_used~0_In-1585872093) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585872093, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1585872093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1585872093, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1585872093} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1585872093|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585872093, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1585872093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1585872093, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1585872093} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 21:46:28,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In217067818 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In217067818 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out217067818| ~z$r_buff0_thd3~0_In217067818)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out217067818| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In217067818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In217067818} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out217067818|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In217067818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In217067818} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 21:46:28,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In900657691 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In900657691 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In900657691 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In900657691 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out900657691|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite43_Out900657691| ~z$r_buff1_thd3~0_In900657691) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In900657691, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900657691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900657691, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900657691} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In900657691, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900657691, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out900657691|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900657691, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900657691} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 21:46:28,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:46:28,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:46:28,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out116258109| |ULTIMATE.start_main_#t~ite48_Out116258109|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In116258109 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In116258109 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out116258109| ~z~0_In116258109) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out116258109| ~z$w_buff1~0_In116258109) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In116258109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116258109, ~z$w_buff1~0=~z$w_buff1~0_In116258109, ~z~0=~z~0_In116258109} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In116258109, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out116258109|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In116258109, ~z$w_buff1~0=~z$w_buff1~0_In116258109, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out116258109|, ~z~0=~z~0_In116258109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:46:28,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2123826271 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2123826271 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2123826271| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2123826271| ~z$w_buff0_used~0_In2123826271)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2123826271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2123826271} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2123826271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2123826271, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2123826271|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:46:28,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-65164050 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-65164050 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-65164050 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-65164050 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-65164050| ~z$w_buff1_used~0_In-65164050)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-65164050|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-65164050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65164050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-65164050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65164050} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-65164050|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-65164050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65164050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-65164050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65164050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:46:28,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In468604983 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In468604983 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out468604983| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In468604983 |ULTIMATE.start_main_#t~ite51_Out468604983|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In468604983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In468604983} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In468604983, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out468604983|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In468604983} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:46:28,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1997082009 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1997082009 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1997082009 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1997082009 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1997082009|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-1997082009 |ULTIMATE.start_main_#t~ite52_Out-1997082009|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1997082009, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997082009, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1997082009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1997082009} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1997082009|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1997082009, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997082009, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1997082009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1997082009} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:46:28,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:46:28,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:46:28 BasicIcfg [2019-12-18 21:46:28,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:46:28,427 INFO L168 Benchmark]: Toolchain (without parser) took 92029.51 ms. Allocated memory was 144.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,427 INFO L168 Benchmark]: CDTParser took 0.17 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 21:46:28,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.41 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,433 INFO L168 Benchmark]: Boogie Preprocessor took 40.11 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,433 INFO L168 Benchmark]: RCFGBuilder took 840.65 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 100.3 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,434 INFO L168 Benchmark]: TraceAbstraction took 90276.40 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 21:46:28,440 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.17 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 808.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.41 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.11 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.65 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 100.3 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90276.40 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.9s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5696 SDtfs, 7049 SDslu, 19103 SDs, 0 SdLazy, 8752 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 41 SyntacticMatches, 19 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 236548 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1322 NumberOfCodeBlocks, 1322 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 243844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...