/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:52:22,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:52:22,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:52:22,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:52:22,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:52:22,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:52:22,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:52:22,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:52:22,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:52:22,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:52:22,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:52:22,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:52:22,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:52:22,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:52:22,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:52:22,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:52:22,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:52:22,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:52:22,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:52:22,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:52:22,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:52:22,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:52:22,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:52:22,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:52:22,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:52:22,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:52:22,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:52:22,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:52:22,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:52:22,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:52:22,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:52:22,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:52:22,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:52:22,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:52:22,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:52:22,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:52:22,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:52:22,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:52:22,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:52:22,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:52:22,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:52:22,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:52:22,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:52:22,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:52:22,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:52:22,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:52:22,235 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:52:22,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:52:22,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:52:22,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:52:22,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:52:22,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:52:22,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:52:22,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:52:22,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:52:22,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:52:22,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:52:22,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:52:22,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:52:22,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:52:22,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:52:22,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:52:22,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:52:22,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:52:22,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:52:22,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:52:22,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:52:22,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:52:22,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:52:22,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:52:22,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:52:22,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:52:22,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:52:22,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:52:22,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:52:22,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:52:22,527 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:52:22,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 12:52:22,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a8de974/ff5bf1826a2049269c51ce0946e821a3/FLAGfaf2f4c3e [2019-12-18 12:52:23,142 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:52:23,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-18 12:52:23,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a8de974/ff5bf1826a2049269c51ce0946e821a3/FLAGfaf2f4c3e [2019-12-18 12:52:23,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a8de974/ff5bf1826a2049269c51ce0946e821a3 [2019-12-18 12:52:23,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:52:23,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:52:23,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:52:23,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:52:23,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:52:23,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:52:23" (1/1) ... [2019-12-18 12:52:23,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd42c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:23, skipping insertion in model container [2019-12-18 12:52:23,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:52:23" (1/1) ... [2019-12-18 12:52:23,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:52:23,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:52:24,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:52:24,095 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:52:24,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:52:24,309 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:52:24,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24 WrapperNode [2019-12-18 12:52:24,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:52:24,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:52:24,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:52:24,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:52:24,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:52:24,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:52:24,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:52:24,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:52:24,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... [2019-12-18 12:52:24,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:52:24,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:52:24,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:52:24,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:52:24,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:52:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:52:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:52:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:52:24,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:52:24,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:52:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:52:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:52:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:52:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:52:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:52:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:52:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:52:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:52:24,499 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 12:52:25,289 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:52:25,289 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:52:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:52:25 BoogieIcfgContainer [2019-12-18 12:52:25,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:52:25,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:52:25,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:52:25,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:52:25,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:52:23" (1/3) ... [2019-12-18 12:52:25,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cbdb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:52:25, skipping insertion in model container [2019-12-18 12:52:25,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:52:24" (2/3) ... [2019-12-18 12:52:25,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cbdb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:52:25, skipping insertion in model container [2019-12-18 12:52:25,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:52:25" (3/3) ... [2019-12-18 12:52:25,304 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2019-12-18 12:52:25,314 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:52:25,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:52:25,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:52:25,328 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:52:25,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:52:25,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:52:25,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:52:25,499 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:52:25,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:52:25,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:52:25,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:52:25,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:52:25,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:52:25,499 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:52:25,518 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:52:25,521 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:52:25,608 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:52:25,608 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:52:25,627 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:52:25,657 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:52:25,708 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:52:25,709 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:52:25,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:52:25,750 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:52:25,751 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:52:31,012 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 12:52:31,453 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:52:31,605 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:52:31,628 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 12:52:31,628 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 12:52:31,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:52:50,162 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 12:52:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 12:52:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:52:50,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:50,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:52:50,171 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 12:52:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 12:52:50,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:50,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275950485] [2019-12-18 12:52:50,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:50,404 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 12:52:50,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275950485] [2019-12-18 12:52:50,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:50,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:52:50,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561086579] [2019-12-18 12:52:50,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:50,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:50,433 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 12:52:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:52,138 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 12:52:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:52,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:52:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:52,824 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 12:52:52,824 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 12:52:52,826 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 12:53:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 12:53:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 12:53:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 12:53:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 12:53:03,394 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 12:53:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:03,395 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 12:53:03,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 12:53:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:53:03,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:03,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:03,400 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 12:53:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 12:53:03,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:03,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375672624] [2019-12-18 12:53:03,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:03,536 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 12:53:03,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375672624] [2019-12-18 12:53:03,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:03,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:03,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100006337] [2019-12-18 12:53:03,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:03,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:03,540 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 12:53:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:08,658 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 12:53:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:53:08,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:53:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:09,232 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 12:53:09,233 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 12:53:09,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 12:53:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 12:53:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 12:53:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 12:53:24,195 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 12:53:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:24,196 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 12:53:24,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 12:53:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:53:24,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:24,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:24,205 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 12:53:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 12:53:24,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:24,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703798755] [2019-12-18 12:53:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:24,296 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 12:53:24,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703798755] [2019-12-18 12:53:24,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:24,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:24,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225001687] [2019-12-18 12:53:24,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:24,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:24,298 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 12:53:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:24,426 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 12:53:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:24,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:53:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:24,521 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 12:53:24,521 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 12:53:24,522 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 12:53:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 12:53:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 12:53:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 12:53:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 12:53:25,289 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 12:53:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:25,290 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 12:53:25,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 12:53:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:53:25,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:25,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:25,295 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 12:53:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 12:53:25,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:25,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733985072] [2019-12-18 12:53:25,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:25,453 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 12:53:25,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733985072] [2019-12-18 12:53:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:25,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319923514] [2019-12-18 12:53:25,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:53:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:53:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:25,455 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 12:53:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:27,175 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 12:53:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:53:27,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:53:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:27,256 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 12:53:27,256 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 12:53:27,257 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 12:53:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 12:53:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 12:53:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 12:53:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 12:53:28,053 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 12:53:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:28,054 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 12:53:28,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:53:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 12:53:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:53:28,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:28,064 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 12:53:28,064 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 12:53:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 12:53:28,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:28,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595335958] [2019-12-18 12:53:28,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:28,186 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 12:53:28,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595335958] [2019-12-18 12:53:28,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:28,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:53:28,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659828893] [2019-12-18 12:53:28,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:53:28,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:53:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:53:28,189 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 12:53:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:29,281 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 12:53:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:53:29,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:53:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:29,388 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 12:53:29,388 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 12:53:29,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:53:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 12:53:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 12:53:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 12:53:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 12:53:32,420 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 12:53:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:32,420 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 12:53:32,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:53:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 12:53:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:53:32,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:32,434 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 12:53:32,434 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 12:53:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 12:53:32,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:32,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567112798] [2019-12-18 12:53:32,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:32,512 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 12:53:32,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567112798] [2019-12-18 12:53:32,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:32,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:32,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567051120] [2019-12-18 12:53:32,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:32,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:32,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:32,515 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 12:53:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:32,586 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 12:53:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:53:32,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:53:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:32,615 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 12:53:32,615 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 12:53:32,616 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 12:53:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 12:53:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 12:53:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 12:53:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 12:53:32,914 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 12:53:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:32,914 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 12:53:32,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 12:53:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:53:32,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:32,925 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 12:53:32,926 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 12:53:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 12:53:32,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:32,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799218184] [2019-12-18 12:53:32,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:33,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799218184] [2019-12-18 12:53:33,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:33,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:53:33,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506415382] [2019-12-18 12:53:33,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:53:33,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:33,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:53:33,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:53:33,033 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 12:53:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:33,689 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 12:53:33,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:53:33,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:53:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:33,734 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 12:53:33,735 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 12:53:33,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:53:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 12:53:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 12:53:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 12:53:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 12:53:34,269 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 12:53:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:34,269 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 12:53:34,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:53:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 12:53:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:53:34,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:34,298 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 12:53:34,298 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 12:53:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 12:53:34,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:34,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647709842] [2019-12-18 12:53:34,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:34,467 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 12:53:34,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647709842] [2019-12-18 12:53:34,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:34,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:53:34,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110404573] [2019-12-18 12:53:34,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:34,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:34,470 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 12:53:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:35,733 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 12:53:35,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:53:35,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:53:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:35,767 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 12:53:35,768 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 12:53:35,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:53:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 12:53:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 12:53:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 12:53:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 12:53:36,335 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 12:53:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:36,335 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 12:53:36,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 12:53:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:53:36,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:36,357 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 12:53:36,358 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 12:53:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 12:53:36,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:36,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649343561] [2019-12-18 12:53:36,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:36,417 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 12:53:36,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649343561] [2019-12-18 12:53:36,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:36,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:36,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229023743] [2019-12-18 12:53:36,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:36,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:36,421 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 12:53:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:36,558 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 12:53:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:36,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:53:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:36,595 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 12:53:36,595 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 12:53:36,595 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 12:53:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 12:53:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 12:53:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 12:53:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 12:53:36,972 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 12:53:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:36,972 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 12:53:36,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 12:53:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:53:36,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:36,994 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 12:53:36,994 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 12:53:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 12:53:36,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:36,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266430646] [2019-12-18 12:53:36,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:37,062 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 12:53:37,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266430646] [2019-12-18 12:53:37,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:37,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:37,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073382058] [2019-12-18 12:53:37,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:37,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:37,064 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 12:53:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:37,176 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 12:53:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:53:37,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:53:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:37,192 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 12:53:37,193 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 12:53:37,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 12:53:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 12:53:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 12:53:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 12:53:37,346 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 12:53:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:37,346 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 12:53:37,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 12:53:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:53:37,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:37,360 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 12:53:37,360 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 12:53:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 12:53:37,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:37,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388075] [2019-12-18 12:53:37,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:37,417 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 12:53:37,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388075] [2019-12-18 12:53:37,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:37,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:53:37,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870249260] [2019-12-18 12:53:37,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:53:37,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:53:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:37,420 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 12:53:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:37,472 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 12:53:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:53:37,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:53:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:37,486 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 12:53:37,486 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 12:53:37,487 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 12:53:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 12:53:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 12:53:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 12:53:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 12:53:37,665 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 12:53:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:37,666 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 12:53:37,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:53:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 12:53:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:37,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:37,681 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] [2019-12-18 12:53:37,681 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 12:53:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 12:53:37,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:37,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023609614] [2019-12-18 12:53:37,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:37,742 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 12:53:37,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023609614] [2019-12-18 12:53:37,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:37,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:37,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506684784] [2019-12-18 12:53:37,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:37,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:37,745 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 12:53:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:37,850 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 12:53:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:37,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:53:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:37,870 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 12:53:37,870 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 12:53:37,871 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 12:53:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 12:53:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 12:53:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 12:53:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 12:53:38,096 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 12:53:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:38,097 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 12:53:38,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 12:53:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:38,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:38,109 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] [2019-12-18 12:53:38,109 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 12:53:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 12:53:38,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:38,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017228871] [2019-12-18 12:53:38,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:38,201 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 12:53:38,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017228871] [2019-12-18 12:53:38,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:38,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:53:38,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504123553] [2019-12-18 12:53:38,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:38,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:38,203 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 12:53:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:38,463 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 12:53:38,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:53:38,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:53:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:38,479 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 12:53:38,479 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 12:53:38,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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 12:53:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 12:53:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 12:53:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 12:53:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 12:53:38,644 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 12:53:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:38,644 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 12:53:38,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 12:53:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:38,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:38,654 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] [2019-12-18 12:53:38,655 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 12:53:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 12:53:38,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:38,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283255632] [2019-12-18 12:53:38,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:38,751 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 12:53:38,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283255632] [2019-12-18 12:53:38,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:38,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:53:38,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818757432] [2019-12-18 12:53:38,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:38,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:38,753 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 12:53:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:39,021 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 12:53:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:53:39,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:53:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:39,042 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:53:39,234 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 12:53:39,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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 12:53:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 12:53:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 12:53:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 12:53:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 12:53:39,407 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 12:53:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:39,407 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 12:53:39,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 12:53:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:39,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:39,418 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] [2019-12-18 12:53:39,418 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 12:53:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 12:53:39,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:39,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957151834] [2019-12-18 12:53:39,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:39,571 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 12:53:39,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957151834] [2019-12-18 12:53:39,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:39,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:39,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094879891] [2019-12-18 12:53:39,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:53:39,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:53:39,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:53:39,573 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 12:53:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:40,770 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 12:53:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:53:40,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:53:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:40,831 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 12:53:40,832 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 12:53:40,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:53:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 12:53:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 12:53:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 12:53:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 12:53:41,188 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 12:53:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:41,188 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 12:53:41,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:53:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 12:53:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:41,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:41,204 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] [2019-12-18 12:53:41,204 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 12:53:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 12:53:41,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:41,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188231437] [2019-12-18 12:53:41,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:41,248 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 12:53:41,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188231437] [2019-12-18 12:53:41,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:41,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:41,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660418832] [2019-12-18 12:53:41,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:41,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:41,252 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 12:53:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:41,341 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 12:53:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:41,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:53:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:41,365 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 12:53:41,366 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 12:53:41,366 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 12:53:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 12:53:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 12:53:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 12:53:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 12:53:41,589 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 12:53:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:41,589 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 12:53:41,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 12:53:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:41,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:41,607 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] [2019-12-18 12:53:41,608 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 12:53:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 12:53:41,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:41,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288072673] [2019-12-18 12:53:41,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:41,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288072673] [2019-12-18 12:53:41,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:41,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:41,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979368564] [2019-12-18 12:53:41,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:53:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:53:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:53:41,727 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 12:53:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:42,702 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 12:53:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:53:42,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:53:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:42,738 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 12:53:42,738 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 12:53:42,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:53:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 12:53:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 12:53:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 12:53:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 12:53:43,007 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 12:53:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:43,007 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 12:53:43,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:53:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 12:53:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:53:43,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:43,018 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] [2019-12-18 12:53:43,018 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 12:53:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 12:53:43,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:43,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498235772] [2019-12-18 12:53:43,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:43,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 12:53:43,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498235772] [2019-12-18 12:53:43,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:43,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:43,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787540653] [2019-12-18 12:53:43,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:43,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:43,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:43,107 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 3 states. [2019-12-18 12:53:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:43,148 INFO L93 Difference]: Finished difference Result 8548 states and 26013 transitions. [2019-12-18 12:53:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:43,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:53:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:43,162 INFO L225 Difference]: With dead ends: 8548 [2019-12-18 12:53:43,162 INFO L226 Difference]: Without dead ends: 8548 [2019-12-18 12:53:43,163 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 12:53:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2019-12-18 12:53:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 8548. [2019-12-18 12:53:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8548 states. [2019-12-18 12:53:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8548 states to 8548 states and 26013 transitions. [2019-12-18 12:53:43,482 INFO L78 Accepts]: Start accepts. Automaton has 8548 states and 26013 transitions. Word has length 64 [2019-12-18 12:53:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:43,482 INFO L462 AbstractCegarLoop]: Abstraction has 8548 states and 26013 transitions. [2019-12-18 12:53:43,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8548 states and 26013 transitions. [2019-12-18 12:53:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:43,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:43,491 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 12:53:43,491 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 12:53:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash 950504329, now seen corresponding path program 1 times [2019-12-18 12:53:43,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274715349] [2019-12-18 12:53:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:43,604 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 12:53:43,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274715349] [2019-12-18 12:53:43,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:43,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:53:43,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496929749] [2019-12-18 12:53:43,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:53:43,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:53:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:53:43,606 INFO L87 Difference]: Start difference. First operand 8548 states and 26013 transitions. Second operand 8 states. [2019-12-18 12:53:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:44,368 INFO L93 Difference]: Finished difference Result 15106 states and 45404 transitions. [2019-12-18 12:53:44,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:53:44,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:53:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:44,385 INFO L225 Difference]: With dead ends: 15106 [2019-12-18 12:53:44,385 INFO L226 Difference]: Without dead ends: 11359 [2019-12-18 12:53:44,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:53:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-18 12:53:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 9012. [2019-12-18 12:53:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2019-12-18 12:53:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 27166 transitions. [2019-12-18 12:53:44,542 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 27166 transitions. Word has length 65 [2019-12-18 12:53:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:44,542 INFO L462 AbstractCegarLoop]: Abstraction has 9012 states and 27166 transitions. [2019-12-18 12:53:44,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:53:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 27166 transitions. [2019-12-18 12:53:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:44,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:44,551 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 12:53:44,551 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 12:53:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 406915929, now seen corresponding path program 2 times [2019-12-18 12:53:44,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:44,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2382705] [2019-12-18 12:53:44,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:44,662 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 12:53:44,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2382705] [2019-12-18 12:53:44,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:44,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:44,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759583251] [2019-12-18 12:53:44,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:53:44,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:44,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:53:44,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:53:44,664 INFO L87 Difference]: Start difference. First operand 9012 states and 27166 transitions. Second operand 9 states. [2019-12-18 12:53:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:45,459 INFO L93 Difference]: Finished difference Result 14370 states and 42744 transitions. [2019-12-18 12:53:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:53:45,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:53:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:45,475 INFO L225 Difference]: With dead ends: 14370 [2019-12-18 12:53:45,475 INFO L226 Difference]: Without dead ends: 11039 [2019-12-18 12:53:45,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:53:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11039 states. [2019-12-18 12:53:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11039 to 8852. [2019-12-18 12:53:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8852 states. [2019-12-18 12:53:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8852 states to 8852 states and 26638 transitions. [2019-12-18 12:53:45,626 INFO L78 Accepts]: Start accepts. Automaton has 8852 states and 26638 transitions. Word has length 65 [2019-12-18 12:53:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:45,627 INFO L462 AbstractCegarLoop]: Abstraction has 8852 states and 26638 transitions. [2019-12-18 12:53:45,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:53:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8852 states and 26638 transitions. [2019-12-18 12:53:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:45,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:45,635 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 12:53:45,635 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 12:53:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1792236963, now seen corresponding path program 3 times [2019-12-18 12:53:45,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:45,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761063328] [2019-12-18 12:53:45,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:45,794 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 12:53:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761063328] [2019-12-18 12:53:45,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:45,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:53:45,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663507610] [2019-12-18 12:53:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:53:45,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:53:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:53:45,796 INFO L87 Difference]: Start difference. First operand 8852 states and 26638 transitions. Second operand 10 states. [2019-12-18 12:53:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:47,529 INFO L93 Difference]: Finished difference Result 18176 states and 53149 transitions. [2019-12-18 12:53:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:53:47,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:53:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:47,566 INFO L225 Difference]: With dead ends: 18176 [2019-12-18 12:53:47,567 INFO L226 Difference]: Without dead ends: 17936 [2019-12-18 12:53:47,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:53:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17936 states. [2019-12-18 12:53:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17936 to 13739. [2019-12-18 12:53:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13739 states. [2019-12-18 12:53:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 40385 transitions. [2019-12-18 12:53:47,868 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 40385 transitions. Word has length 65 [2019-12-18 12:53:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:47,868 INFO L462 AbstractCegarLoop]: Abstraction has 13739 states and 40385 transitions. [2019-12-18 12:53:47,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:53:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 40385 transitions. [2019-12-18 12:53:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:47,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:47,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:47,881 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 12:53:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2042131627, now seen corresponding path program 4 times [2019-12-18 12:53:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:47,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328446476] [2019-12-18 12:53:47,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:47,970 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 12:53:47,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328446476] [2019-12-18 12:53:47,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:47,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:53:47,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712492362] [2019-12-18 12:53:47,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:47,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:47,972 INFO L87 Difference]: Start difference. First operand 13739 states and 40385 transitions. Second operand 7 states. [2019-12-18 12:53:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:48,701 INFO L93 Difference]: Finished difference Result 24335 states and 69905 transitions. [2019-12-18 12:53:48,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:53:48,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:53:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:48,732 INFO L225 Difference]: With dead ends: 24335 [2019-12-18 12:53:48,732 INFO L226 Difference]: Without dead ends: 24167 [2019-12-18 12:53:48,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:53:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24167 states. [2019-12-18 12:53:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24167 to 16933. [2019-12-18 12:53:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16933 states. [2019-12-18 12:53:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16933 states to 16933 states and 49369 transitions. [2019-12-18 12:53:49,332 INFO L78 Accepts]: Start accepts. Automaton has 16933 states and 49369 transitions. Word has length 65 [2019-12-18 12:53:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:49,332 INFO L462 AbstractCegarLoop]: Abstraction has 16933 states and 49369 transitions. [2019-12-18 12:53:49,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 16933 states and 49369 transitions. [2019-12-18 12:53:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:49,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:49,347 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 12:53:49,347 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 12:53:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -505523827, now seen corresponding path program 5 times [2019-12-18 12:53:49,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:49,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463389459] [2019-12-18 12:53:49,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:49,530 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 12:53:49,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463389459] [2019-12-18 12:53:49,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:49,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:53:49,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104917521] [2019-12-18 12:53:49,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:49,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:49,537 INFO L87 Difference]: Start difference. First operand 16933 states and 49369 transitions. Second operand 11 states. [2019-12-18 12:53:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:51,153 INFO L93 Difference]: Finished difference Result 23420 states and 67432 transitions. [2019-12-18 12:53:51,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:53:51,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:53:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:51,183 INFO L225 Difference]: With dead ends: 23420 [2019-12-18 12:53:51,183 INFO L226 Difference]: Without dead ends: 23420 [2019-12-18 12:53:51,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:53:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23420 states. [2019-12-18 12:53:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23420 to 17005. [2019-12-18 12:53:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17005 states. [2019-12-18 12:53:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17005 states to 17005 states and 49569 transitions. [2019-12-18 12:53:51,487 INFO L78 Accepts]: Start accepts. Automaton has 17005 states and 49569 transitions. Word has length 65 [2019-12-18 12:53:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:51,487 INFO L462 AbstractCegarLoop]: Abstraction has 17005 states and 49569 transitions. [2019-12-18 12:53:51,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17005 states and 49569 transitions. [2019-12-18 12:53:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:51,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:51,508 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 12:53:51,508 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 12:53:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1882026893, now seen corresponding path program 6 times [2019-12-18 12:53:51,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:51,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487782735] [2019-12-18 12:53:51,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:51,687 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 12:53:51,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487782735] [2019-12-18 12:53:51,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:51,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:53:51,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16171539] [2019-12-18 12:53:51,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:51,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:51,689 INFO L87 Difference]: Start difference. First operand 17005 states and 49569 transitions. Second operand 11 states. [2019-12-18 12:53:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:53,810 INFO L93 Difference]: Finished difference Result 23888 states and 68662 transitions. [2019-12-18 12:53:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:53:53,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:53:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:53,840 INFO L225 Difference]: With dead ends: 23888 [2019-12-18 12:53:53,841 INFO L226 Difference]: Without dead ends: 23888 [2019-12-18 12:53:53,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:53:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23888 states. [2019-12-18 12:53:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23888 to 16165. [2019-12-18 12:53:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16165 states. [2019-12-18 12:53:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16165 states to 16165 states and 47247 transitions. [2019-12-18 12:53:54,129 INFO L78 Accepts]: Start accepts. Automaton has 16165 states and 47247 transitions. Word has length 65 [2019-12-18 12:53:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:54,129 INFO L462 AbstractCegarLoop]: Abstraction has 16165 states and 47247 transitions. [2019-12-18 12:53:54,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 16165 states and 47247 transitions. [2019-12-18 12:53:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:54,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:54,145 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 12:53:54,145 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 12:53:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1887248817, now seen corresponding path program 7 times [2019-12-18 12:53:54,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:54,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535734868] [2019-12-18 12:53:54,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:54,212 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 12:53:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535734868] [2019-12-18 12:53:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:54,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:53:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422426988] [2019-12-18 12:53:54,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:53:54,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:53:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:54,214 INFO L87 Difference]: Start difference. First operand 16165 states and 47247 transitions. Second operand 5 states. [2019-12-18 12:53:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:54,543 INFO L93 Difference]: Finished difference Result 18069 states and 52531 transitions. [2019-12-18 12:53:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:53:54,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 12:53:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:54,566 INFO L225 Difference]: With dead ends: 18069 [2019-12-18 12:53:54,566 INFO L226 Difference]: Without dead ends: 18069 [2019-12-18 12:53:54,567 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 12:53:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18069 states. [2019-12-18 12:53:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18069 to 16852. [2019-12-18 12:53:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2019-12-18 12:53:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 49238 transitions. [2019-12-18 12:53:54,821 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 49238 transitions. Word has length 65 [2019-12-18 12:53:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:54,822 INFO L462 AbstractCegarLoop]: Abstraction has 16852 states and 49238 transitions. [2019-12-18 12:53:54,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:53:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 49238 transitions. [2019-12-18 12:53:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:53:54,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:54,837 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 12:53:54,838 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 12:53:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:54,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1895624641, now seen corresponding path program 8 times [2019-12-18 12:53:54,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:54,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95909485] [2019-12-18 12:53:54,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:55,176 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-18 12:53:55,196 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 12:53:55,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95909485] [2019-12-18 12:53:55,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:55,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:55,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364285689] [2019-12-18 12:53:55,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:55,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:55,199 INFO L87 Difference]: Start difference. First operand 16852 states and 49238 transitions. Second operand 3 states. [2019-12-18 12:53:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:55,289 INFO L93 Difference]: Finished difference Result 16852 states and 49237 transitions. [2019-12-18 12:53:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:55,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:53:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:55,322 INFO L225 Difference]: With dead ends: 16852 [2019-12-18 12:53:55,322 INFO L226 Difference]: Without dead ends: 16852 [2019-12-18 12:53:55,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2019-12-18 12:53:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 15231. [2019-12-18 12:53:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15231 states. [2019-12-18 12:53:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15231 states to 15231 states and 44738 transitions. [2019-12-18 12:53:55,712 INFO L78 Accepts]: Start accepts. Automaton has 15231 states and 44738 transitions. Word has length 65 [2019-12-18 12:53:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:55,713 INFO L462 AbstractCegarLoop]: Abstraction has 15231 states and 44738 transitions. [2019-12-18 12:53:55,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 15231 states and 44738 transitions. [2019-12-18 12:53:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:53:55,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:55,729 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 12:53:55,729 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 12:53:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 1 times [2019-12-18 12:53:55,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:55,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298187522] [2019-12-18 12:53:55,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:56,245 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 12:53:56,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298187522] [2019-12-18 12:53:56,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:56,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:53:56,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117399487] [2019-12-18 12:53:56,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:53:56,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:53:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:53:56,247 INFO L87 Difference]: Start difference. First operand 15231 states and 44738 transitions. Second operand 17 states. [2019-12-18 12:53:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:59,409 INFO L93 Difference]: Finished difference Result 23279 states and 66855 transitions. [2019-12-18 12:53:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:53:59,410 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 12:53:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:59,437 INFO L225 Difference]: With dead ends: 23279 [2019-12-18 12:53:59,437 INFO L226 Difference]: Without dead ends: 20533 [2019-12-18 12:53:59,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:53:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20533 states. [2019-12-18 12:53:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20533 to 15376. [2019-12-18 12:53:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15376 states. [2019-12-18 12:53:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15376 states to 15376 states and 45115 transitions. [2019-12-18 12:53:59,688 INFO L78 Accepts]: Start accepts. Automaton has 15376 states and 45115 transitions. Word has length 66 [2019-12-18 12:53:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:59,689 INFO L462 AbstractCegarLoop]: Abstraction has 15376 states and 45115 transitions. [2019-12-18 12:53:59,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:53:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15376 states and 45115 transitions. [2019-12-18 12:53:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:53:59,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:59,702 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 12:53:59,703 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:53:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 2 times [2019-12-18 12:53:59,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:59,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073681463] [2019-12-18 12:53:59,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:00,023 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 12:54:00,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073681463] [2019-12-18 12:54:00,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:00,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:54:00,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607951035] [2019-12-18 12:54:00,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:54:00,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:54:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:54:00,025 INFO L87 Difference]: Start difference. First operand 15376 states and 45115 transitions. Second operand 14 states. [2019-12-18 12:54:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:02,127 INFO L93 Difference]: Finished difference Result 18896 states and 54759 transitions. [2019-12-18 12:54:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:54:02,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 12:54:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:02,151 INFO L225 Difference]: With dead ends: 18896 [2019-12-18 12:54:02,151 INFO L226 Difference]: Without dead ends: 17677 [2019-12-18 12:54:02,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 12:54:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17677 states. [2019-12-18 12:54:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17677 to 15486. [2019-12-18 12:54:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15486 states. [2019-12-18 12:54:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15486 states to 15486 states and 45385 transitions. [2019-12-18 12:54:02,392 INFO L78 Accepts]: Start accepts. Automaton has 15486 states and 45385 transitions. Word has length 66 [2019-12-18 12:54:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:02,392 INFO L462 AbstractCegarLoop]: Abstraction has 15486 states and 45385 transitions. [2019-12-18 12:54:02,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:54:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15486 states and 45385 transitions. [2019-12-18 12:54:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:54:02,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:02,407 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 12:54:02,407 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash 954345302, now seen corresponding path program 3 times [2019-12-18 12:54:02,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:02,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723159389] [2019-12-18 12:54:02,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:02,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 12:54:02,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723159389] [2019-12-18 12:54:02,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:02,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:54:02,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008661238] [2019-12-18 12:54:02,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:54:02,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:02,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:54:02,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:54:02,958 INFO L87 Difference]: Start difference. First operand 15486 states and 45385 transitions. Second operand 11 states. [2019-12-18 12:54:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:04,070 INFO L93 Difference]: Finished difference Result 25124 states and 72934 transitions. [2019-12-18 12:54:04,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:54:04,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:54:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:04,095 INFO L225 Difference]: With dead ends: 25124 [2019-12-18 12:54:04,095 INFO L226 Difference]: Without dead ends: 18237 [2019-12-18 12:54:04,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:54:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18237 states. [2019-12-18 12:54:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18237 to 14682. [2019-12-18 12:54:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14682 states. [2019-12-18 12:54:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14682 states to 14682 states and 43153 transitions. [2019-12-18 12:54:04,349 INFO L78 Accepts]: Start accepts. Automaton has 14682 states and 43153 transitions. Word has length 66 [2019-12-18 12:54:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:04,349 INFO L462 AbstractCegarLoop]: Abstraction has 14682 states and 43153 transitions. [2019-12-18 12:54:04,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:54:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 14682 states and 43153 transitions. [2019-12-18 12:54:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:54:04,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:04,365 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 12:54:04,365 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 4 times [2019-12-18 12:54:04,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:04,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724598875] [2019-12-18 12:54:04,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:04,547 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 12:54:04,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724598875] [2019-12-18 12:54:04,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:04,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:54:04,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280671313] [2019-12-18 12:54:04,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:54:04,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:54:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:54:04,549 INFO L87 Difference]: Start difference. First operand 14682 states and 43153 transitions. Second operand 10 states. [2019-12-18 12:54:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:06,657 INFO L93 Difference]: Finished difference Result 29344 states and 84085 transitions. [2019-12-18 12:54:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:54:06,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:54:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:06,694 INFO L225 Difference]: With dead ends: 29344 [2019-12-18 12:54:06,695 INFO L226 Difference]: Without dead ends: 28936 [2019-12-18 12:54:06,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:54:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28936 states. [2019-12-18 12:54:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28936 to 13934. [2019-12-18 12:54:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13934 states. [2019-12-18 12:54:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13934 states to 13934 states and 41097 transitions. [2019-12-18 12:54:07,004 INFO L78 Accepts]: Start accepts. Automaton has 13934 states and 41097 transitions. Word has length 66 [2019-12-18 12:54:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:07,005 INFO L462 AbstractCegarLoop]: Abstraction has 13934 states and 41097 transitions. [2019-12-18 12:54:07,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:54:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13934 states and 41097 transitions. [2019-12-18 12:54:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:54:07,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:07,019 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 12:54:07,019 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 5 times [2019-12-18 12:54:07,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:07,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706742467] [2019-12-18 12:54:07,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:07,113 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 12:54:07,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706742467] [2019-12-18 12:54:07,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:07,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:54:07,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943759691] [2019-12-18 12:54:07,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:54:07,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:54:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:54:07,115 INFO L87 Difference]: Start difference. First operand 13934 states and 41097 transitions. Second operand 4 states. [2019-12-18 12:54:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:07,219 INFO L93 Difference]: Finished difference Result 15962 states and 47260 transitions. [2019-12-18 12:54:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:54:07,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:54:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:07,238 INFO L225 Difference]: With dead ends: 15962 [2019-12-18 12:54:07,239 INFO L226 Difference]: Without dead ends: 15962 [2019-12-18 12:54:07,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 12:54:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2019-12-18 12:54:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 12856. [2019-12-18 12:54:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12856 states. [2019-12-18 12:54:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12856 states to 12856 states and 38280 transitions. [2019-12-18 12:54:07,462 INFO L78 Accepts]: Start accepts. Automaton has 12856 states and 38280 transitions. Word has length 66 [2019-12-18 12:54:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:07,462 INFO L462 AbstractCegarLoop]: Abstraction has 12856 states and 38280 transitions. [2019-12-18 12:54:07,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:54:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 12856 states and 38280 transitions. [2019-12-18 12:54:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:54:07,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:07,475 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 12:54:07,475 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-18 12:54:07,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:07,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362550242] [2019-12-18 12:54:07,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:07,710 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 12:54:07,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362550242] [2019-12-18 12:54:07,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:07,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:54:07,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145029729] [2019-12-18 12:54:07,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:54:07,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:07,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:54:07,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:54:07,712 INFO L87 Difference]: Start difference. First operand 12856 states and 38280 transitions. Second operand 11 states. [2019-12-18 12:54:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:08,596 INFO L93 Difference]: Finished difference Result 16725 states and 49416 transitions. [2019-12-18 12:54:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:54:08,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:54:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:08,618 INFO L225 Difference]: With dead ends: 16725 [2019-12-18 12:54:08,618 INFO L226 Difference]: Without dead ends: 16304 [2019-12-18 12:54:08,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:54:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-18 12:54:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 12602. [2019-12-18 12:54:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12602 states. [2019-12-18 12:54:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12602 states to 12602 states and 37632 transitions. [2019-12-18 12:54:09,057 INFO L78 Accepts]: Start accepts. Automaton has 12602 states and 37632 transitions. Word has length 67 [2019-12-18 12:54:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:09,057 INFO L462 AbstractCegarLoop]: Abstraction has 12602 states and 37632 transitions. [2019-12-18 12:54:09,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:54:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12602 states and 37632 transitions. [2019-12-18 12:54:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:54:09,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:09,071 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 12:54:09,071 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-18 12:54:09,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:09,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777525348] [2019-12-18 12:54:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:54:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:54:09,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:54:09,236 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:54:09,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24|) |v_ULTIMATE.start_main_~#t633~0.offset_19| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24| 1)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t633~0.base_24|) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t633~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= |v_ULTIMATE.start_main_~#t633~0.offset_19| 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_26|, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t633~0.base=|v_ULTIMATE.start_main_~#t633~0.base_24|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_19|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t633~0.offset=|v_ULTIMATE.start_main_~#t633~0.offset_19|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t635~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t635~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t634~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t633~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t634~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t633~0.offset] because there is no mapped edge [2019-12-18 12:54:09,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t634~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t634~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t634~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10|) |v_ULTIMATE.start_main_~#t634~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t634~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t634~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t634~0.offset] because there is no mapped edge [2019-12-18 12:54:09,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t635~0.base_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t635~0.base_13|)) (= |v_ULTIMATE.start_main_~#t635~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13|) |v_ULTIMATE.start_main_~#t635~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t635~0.base_13| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_13|, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t635~0.base, ULTIMATE.start_main_~#t635~0.offset] because there is no mapped edge [2019-12-18 12:54:09,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:54:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In789645156 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In789645156 256)))) (or (and (= ~a~0_In789645156 |P1Thread1of1ForFork2_#t~ite9_Out789645156|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In789645156 |P1Thread1of1ForFork2_#t~ite9_Out789645156|)))) InVars {~a~0=~a~0_In789645156, ~a$w_buff1~0=~a$w_buff1~0_In789645156, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In789645156, ~a$w_buff1_used~0=~a$w_buff1_used~0_In789645156} OutVars{~a~0=~a~0_In789645156, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out789645156|, ~a$w_buff1~0=~a$w_buff1~0_In789645156, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In789645156, ~a$w_buff1_used~0=~a$w_buff1_used~0_In789645156} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:54:09,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-614600237 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-614600237 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-614600237 |P0Thread1of1ForFork1_#t~ite5_Out-614600237|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-614600237|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-614600237, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-614600237} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-614600237|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-614600237, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-614600237} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:54:09,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-576333922 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-576333922 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-576333922 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-576333922 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-576333922| ~a$w_buff1_used~0_In-576333922)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-576333922| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-576333922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-576333922|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-576333922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:54:09,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-438684327 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-438684327 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-438684327 ~a$r_buff0_thd1~0_In-438684327)) (and (= ~a$r_buff0_thd1~0_Out-438684327 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-438684327, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-438684327} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-438684327|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438684327, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-438684327} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:54:09,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In204575494 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In204575494 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In204575494 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In204575494 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out204575494|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In204575494 |P0Thread1of1ForFork1_#t~ite8_Out204575494|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out204575494|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:54:09,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:54:09,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2056532424 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In2056532424| |P2Thread1of1ForFork0_#t~ite20_Out2056532424|) (= |P2Thread1of1ForFork0_#t~ite21_Out2056532424| ~a$w_buff0~0_In2056532424)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out2056532424| ~a$w_buff0~0_In2056532424) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2056532424 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In2056532424 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In2056532424 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2056532424 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out2056532424| |P2Thread1of1ForFork0_#t~ite21_Out2056532424|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In2056532424, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2056532424, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2056532424, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2056532424, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056532424, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In2056532424|, ~weak$$choice2~0=~weak$$choice2~0_In2056532424} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out2056532424|, ~a$w_buff0~0=~a$w_buff0~0_In2056532424, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2056532424, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2056532424, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2056532424, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out2056532424|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056532424, ~weak$$choice2~0=~weak$$choice2~0_In2056532424} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:54:09,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1496072878 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1496072878 |P2Thread1of1ForFork0_#t~ite26_Out-1496072878|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1496072878 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1496072878 256))) (= (mod ~a$w_buff0_used~0_In-1496072878 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1496072878 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1496072878| |P2Thread1of1ForFork0_#t~ite26_Out-1496072878|)) (and (= ~a$w_buff0_used~0_In-1496072878 |P2Thread1of1ForFork0_#t~ite27_Out-1496072878|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1496072878| |P2Thread1of1ForFork0_#t~ite26_Out-1496072878|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1496072878|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878, ~weak$$choice2~0=~weak$$choice2~0_In-1496072878} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1496072878|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1496072878|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878, ~weak$$choice2~0=~weak$$choice2~0_In-1496072878} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:54:09,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-642788930 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-642788930 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-642788930 256))) (= 0 (mod ~a$w_buff0_used~0_In-642788930 256)) (and (= 0 (mod ~a$w_buff1_used~0_In-642788930 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite29_Out-642788930| ~a$w_buff1_used~0_In-642788930) (= |P2Thread1of1ForFork0_#t~ite29_Out-642788930| |P2Thread1of1ForFork0_#t~ite30_Out-642788930|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-642788930| |P2Thread1of1ForFork0_#t~ite29_Out-642788930|) (= ~a$w_buff1_used~0_In-642788930 |P2Thread1of1ForFork0_#t~ite30_Out-642788930|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-642788930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-642788930, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-642788930, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-642788930, ~weak$$choice2~0=~weak$$choice2~0_In-642788930, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-642788930|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-642788930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-642788930, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-642788930, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-642788930|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-642788930, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-642788930|, ~weak$$choice2~0=~weak$$choice2~0_In-642788930} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:54:09,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:54:09,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:54:09,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1418186462 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1418186462 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1418186462 |P1Thread1of1ForFork2_#t~ite11_Out-1418186462|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1418186462|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1418186462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1418186462} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1418186462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1418186462, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1418186462|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:54:09,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1025176683 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1025176683 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1025176683 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1025176683 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1025176683| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1025176683| ~a$w_buff1_used~0_In-1025176683) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1025176683, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1025176683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1025176683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1025176683} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1025176683, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1025176683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1025176683, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1025176683|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1025176683} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:54:09,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-569197058 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-569197058 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-569197058|)) (and (= ~a$r_buff0_thd2~0_In-569197058 |P1Thread1of1ForFork2_#t~ite13_Out-569197058|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-569197058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-569197058} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-569197058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-569197058, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-569197058|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:54:09,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In365126922 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In365126922 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In365126922 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In365126922 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out365126922|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd2~0_In365126922 |P1Thread1of1ForFork2_#t~ite14_Out365126922|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In365126922, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In365126922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In365126922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In365126922} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In365126922, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In365126922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In365126922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In365126922, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out365126922|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:54:09,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:54:09,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:54:09,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1303801498 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1303801498| |P2Thread1of1ForFork0_#t~ite39_Out1303801498|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1303801498 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1303801498| ~a~0_In1303801498)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1303801498| ~a$w_buff1~0_In1303801498) (not .cse1) .cse2 (not .cse0)))) InVars {~a~0=~a~0_In1303801498, ~a$w_buff1~0=~a$w_buff1~0_In1303801498, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1303801498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303801498} OutVars{~a~0=~a~0_In1303801498, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1303801498|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1303801498|, ~a$w_buff1~0=~a$w_buff1~0_In1303801498, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1303801498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303801498} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:54:09,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In329506190 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In329506190 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out329506190| 0)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In329506190 |P2Thread1of1ForFork0_#t~ite40_Out329506190|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In329506190, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In329506190} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out329506190|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In329506190, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In329506190} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:54:09,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In766166987 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In766166987 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In766166987 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In766166987 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out766166987|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In766166987 |P2Thread1of1ForFork0_#t~ite41_Out766166987|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In766166987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In766166987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In766166987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In766166987} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In766166987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In766166987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In766166987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In766166987, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out766166987|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:54:09,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In442648949 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In442648949 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out442648949| ~a$r_buff0_thd3~0_In442648949)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out442648949| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In442648949} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In442648949, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out442648949|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:54:09,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In1569547599 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1569547599 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1569547599 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1569547599 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out1569547599| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In1569547599 |P2Thread1of1ForFork0_#t~ite43_Out1569547599|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1569547599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1569547599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1569547599} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1569547599|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1569547599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1569547599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1569547599} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:54:09,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:54:09,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:54:09,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1285943204 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1285943204 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1285943204| |ULTIMATE.start_main_#t~ite47_Out-1285943204|))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1285943204 |ULTIMATE.start_main_#t~ite47_Out-1285943204|) .cse2) (and (or .cse0 .cse1) (= ~a~0_In-1285943204 |ULTIMATE.start_main_#t~ite47_Out-1285943204|) .cse2))) InVars {~a~0=~a~0_In-1285943204, ~a$w_buff1~0=~a$w_buff1~0_In-1285943204, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1285943204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1285943204} OutVars{~a~0=~a~0_In-1285943204, ~a$w_buff1~0=~a$w_buff1~0_In-1285943204, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1285943204|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1285943204, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1285943204|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1285943204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:54:09,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In739121504 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In739121504 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out739121504|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out739121504| ~a$w_buff0_used~0_In739121504)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In739121504, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In739121504} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In739121504, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out739121504|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In739121504} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:54:09,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In540889421 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In540889421 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In540889421 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In540889421 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out540889421|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In540889421 |ULTIMATE.start_main_#t~ite50_Out540889421|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In540889421, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540889421, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In540889421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In540889421} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out540889421|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In540889421, ~a$w_buff0_used~0=~a$w_buff0_used~0_In540889421, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In540889421, ~a$w_buff1_used~0=~a$w_buff1_used~0_In540889421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:54:09,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1653034033 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1653034033 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1653034033| 0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1653034033 |ULTIMATE.start_main_#t~ite51_Out1653034033|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1653034033, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653034033} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1653034033|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653034033, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653034033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:54:09,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In1956220040 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1956220040 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1956220040 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1956220040 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1956220040| ~a$r_buff1_thd0~0_In1956220040) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out1956220040| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1956220040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1956220040, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1956220040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1956220040} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1956220040|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1956220040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1956220040, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1956220040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1956220040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:54:09,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:54:09,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:54:09 BasicIcfg [2019-12-18 12:54:09,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:54:09,352 INFO L168 Benchmark]: Toolchain (without parser) took 105905.51 ms. Allocated memory was 144.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 103.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 734.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,352 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 144.7 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.93 ms. Allocated memory was 144.7 MB in the beginning and 206.0 MB in the end (delta: 61.3 MB). Free memory was 103.3 MB in the beginning and 159.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 206.0 MB. Free memory was 159.4 MB in the beginning and 156.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,354 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 206.0 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,354 INFO L168 Benchmark]: RCFGBuilder took 878.03 ms. Allocated memory is still 206.0 MB. Free memory was 154.3 MB in the beginning and 104.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,355 INFO L168 Benchmark]: TraceAbstraction took 104057.10 ms. Allocated memory was 206.0 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 673.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:09,357 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 144.7 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.93 ms. Allocated memory was 144.7 MB in the beginning and 206.0 MB in the end (delta: 61.3 MB). Free memory was 103.3 MB in the beginning and 159.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 206.0 MB. Free memory was 159.4 MB in the beginning and 156.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 206.0 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.03 ms. Allocated memory is still 206.0 MB. Free memory was 154.3 MB in the beginning and 104.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104057.10 ms. Allocated memory was 206.0 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 673.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.7s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6860 SDtfs, 10121 SDslu, 24757 SDs, 0 SdLazy, 18000 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 89 SyntacticMatches, 23 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 38.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 164966 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1602 ConstructedInterpolants, 0 QuantifiedInterpolants, 452661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...