/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/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:28:47,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:28:47,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:28:47,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:28:47,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:28:47,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:28:47,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:28:47,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:28:47,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:28:47,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:28:47,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:28:47,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:28:47,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:28:47,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:28:47,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:28:47,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:28:47,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:28:47,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:28:47,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:28:47,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:28:47,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:28:47,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:28:47,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:28:47,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:28:47,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:28:47,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:28:47,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:28:47,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:28:47,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:28:47,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:28:47,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:28:47,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:28:47,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:28:47,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:28:47,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:28:47,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:28:47,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:28:47,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:28:47,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:28:47,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:28:47,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:28:47,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:28:47,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:28:47,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:28:47,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:28:47,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:28:47,200 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:28:47,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:28:47,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:28:47,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:28:47,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:28:47,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:28:47,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:28:47,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:28:47,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:28:47,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:28:47,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:28:47,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:28:47,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:28:47,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:28:47,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:28:47,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:28:47,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:28:47,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:28:47,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:28:47,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:28:47,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:28:47,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:28:47,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:28:47,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:28:47,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:28:47,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:28:47,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:28:47,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:28:47,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:28:47,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:28:47,544 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:28:47,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-26 22:28:47,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf114ed8/f382fb59122b46c0af09a48290513c1d/FLAG43599a9b3 [2019-12-26 22:28:48,136 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:28:48,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-26 22:28:48,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf114ed8/f382fb59122b46c0af09a48290513c1d/FLAG43599a9b3 [2019-12-26 22:28:48,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf114ed8/f382fb59122b46c0af09a48290513c1d [2019-12-26 22:28:48,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:28:48,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:28:48,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:28:48,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:28:48,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:28:48,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:28:48" (1/1) ... [2019-12-26 22:28:48,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:48, skipping insertion in model container [2019-12-26 22:28:48,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:28:48" (1/1) ... [2019-12-26 22:28:48,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:28:48,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:28:49,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:28:49,174 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:28:49,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:28:49,321 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:28:49,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49 WrapperNode [2019-12-26 22:28:49,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:28:49,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:28:49,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:28:49,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:28:49,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:28:49,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:28:49,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:28:49,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:28:49,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... [2019-12-26 22:28:49,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:28:49,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:28:49,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:28:49,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:28:49,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:28:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:28:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:28:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:28:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:28:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:28:49,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:28:49,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:28:49,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:28:49,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:28:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:28:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:28:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:28:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:28:49,512 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:28:50,320 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:28:50,320 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:28:50,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:28:50 BoogieIcfgContainer [2019-12-26 22:28:50,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:28:50,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:28:50,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:28:50,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:28:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:28:48" (1/3) ... [2019-12-26 22:28:50,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b62e8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:28:50, skipping insertion in model container [2019-12-26 22:28:50,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:28:49" (2/3) ... [2019-12-26 22:28:50,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b62e8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:28:50, skipping insertion in model container [2019-12-26 22:28:50,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:28:50" (3/3) ... [2019-12-26 22:28:50,331 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-26 22:28:50,342 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:28:50,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:28:50,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:28:50,351 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:28:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,414 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,414 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,432 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,494 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:28:50,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:28:50,544 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:28:50,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:28:50,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:28:50,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:28:50,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:28:50,545 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:28:50,545 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:28:50,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:28:50,561 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 22:28:50,563 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:28:50,671 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:28:50,672 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:28:50,689 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:28:50,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:28:50,773 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:28:50,774 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:28:50,783 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:28:50,807 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:28:50,808 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:28:56,106 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:28:56,215 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:28:56,528 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:28:56,655 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:28:56,682 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-26 22:28:56,683 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 22:28:56,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:29:11,129 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-26 22:29:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-26 22:29:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:29:11,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:11,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:29:11,137 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-26 22:29:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-26 22:29:11,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:11,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448861464] [2019-12-26 22:29:11,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:12,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448861464] [2019-12-26 22:29:12,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:29:12,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890084942] [2019-12-26 22:29:12,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:29:12,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:29:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:12,523 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-26 22:29:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:13,503 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-26 22:29:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:29:13,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:29:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:16,862 INFO L225 Difference]: With dead ends: 101544 [2019-12-26 22:29:16,862 INFO L226 Difference]: Without dead ends: 95304 [2019-12-26 22:29:16,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-26 22:29:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-26 22:29:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-26 22:29:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-26 22:29:22,907 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-26 22:29:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:22,908 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-26 22:29:22,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:29:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-26 22:29:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:29:22,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:22,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:29:22,913 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-26 22:29:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-26 22:29:22,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:22,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256725374] [2019-12-26 22:29:22,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:23,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256725374] [2019-12-26 22:29:23,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:23,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:29:23,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640684642] [2019-12-26 22:29:23,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:29:23,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:29:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:29:23,030 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-26 22:29:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:27,213 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-26 22:29:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:29:27,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:29:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:28,477 INFO L225 Difference]: With dead ends: 152040 [2019-12-26 22:29:28,477 INFO L226 Difference]: Without dead ends: 151991 [2019-12-26 22:29:28,478 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-26 22:29:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-26 22:29:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-26 22:29:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-26 22:29:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-26 22:29:40,034 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-26 22:29:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:40,034 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-26 22:29:40,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:29:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-26 22:29:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:29:40,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:40,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:29:40,041 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-26 22:29:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-26 22:29:40,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:40,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187978323] [2019-12-26 22:29:40,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:40,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187978323] [2019-12-26 22:29:40,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:29:40,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780613320] [2019-12-26 22:29:40,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:29:40,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:29:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:40,106 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-26 22:29:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:40,224 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-26 22:29:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:29:40,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:29:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:40,285 INFO L225 Difference]: With dead ends: 30915 [2019-12-26 22:29:40,286 INFO L226 Difference]: Without dead ends: 30915 [2019-12-26 22:29:40,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-26 22:29:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-26 22:29:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-26 22:29:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-26 22:29:41,965 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-26 22:29:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:41,966 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-26 22:29:41,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:29:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-26 22:29:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:29:41,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:41,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:29:41,970 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-26 22:29:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-26 22:29:41,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:41,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328771126] [2019-12-26 22:29:41,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:42,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328771126] [2019-12-26 22:29:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:29:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920556294] [2019-12-26 22:29:42,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:29:42,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:29:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:29:42,067 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-26 22:29:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:42,422 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-26 22:29:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:29:42,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:29:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:42,485 INFO L225 Difference]: With dead ends: 38538 [2019-12-26 22:29:42,485 INFO L226 Difference]: Without dead ends: 38538 [2019-12-26 22:29:42,486 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-26 22:29:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-26 22:29:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-26 22:29:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-26 22:29:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-26 22:29:43,115 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-26 22:29:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:43,116 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-26 22:29:43,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:29:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-26 22:29:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:29:43,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:43,126 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-26 22:29:43,126 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-26 22:29:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-26 22:29:43,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:43,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920151163] [2019-12-26 22:29:43,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:43,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920151163] [2019-12-26 22:29:43,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:43,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:29:43,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125575069] [2019-12-26 22:29:43,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:29:43,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:29:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:29:43,230 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-26 22:29:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:45,466 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-26 22:29:45,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:29:45,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:29:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:45,540 INFO L225 Difference]: With dead ends: 44779 [2019-12-26 22:29:45,540 INFO L226 Difference]: Without dead ends: 44772 [2019-12-26 22:29:45,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:29:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-26 22:29:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-26 22:29:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-26 22:29:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-26 22:29:46,222 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-26 22:29:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:46,223 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-26 22:29:46,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:29:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-26 22:29:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:29:46,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:46,235 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-26 22:29:46,236 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-26 22:29:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-26 22:29:46,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:46,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811332517] [2019-12-26 22:29:46,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:46,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811332517] [2019-12-26 22:29:46,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:46,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:29:46,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88524911] [2019-12-26 22:29:46,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:29:46,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:29:46,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:29:46,310 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-26 22:29:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:46,366 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-26 22:29:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:29:46,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:29:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:46,385 INFO L225 Difference]: With dead ends: 13768 [2019-12-26 22:29:46,385 INFO L226 Difference]: Without dead ends: 13768 [2019-12-26 22:29:46,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:29:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-26 22:29:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-26 22:29:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-26 22:29:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-26 22:29:46,857 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-26 22:29:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:46,858 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-26 22:29:46,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:29:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-26 22:29:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:29:46,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:46,868 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-26 22:29:46,868 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-26 22:29:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-26 22:29:46,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:46,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430455962] [2019-12-26 22:29:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:46,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430455962] [2019-12-26 22:29:46,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:46,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:29:46,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658001669] [2019-12-26 22:29:46,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:29:46,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:29:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:46,925 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-26 22:29:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:47,015 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-26 22:29:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:29:47,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:29:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:47,041 INFO L225 Difference]: With dead ends: 19309 [2019-12-26 22:29:47,041 INFO L226 Difference]: Without dead ends: 19309 [2019-12-26 22:29:47,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-26 22:29:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-26 22:29:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-26 22:29:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-26 22:29:47,289 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-26 22:29:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:47,290 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-26 22:29:47,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:29:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-26 22:29:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:29:47,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:47,299 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-26 22:29:47,300 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-26 22:29:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-26 22:29:47,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:47,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690437205] [2019-12-26 22:29:47,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:47,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690437205] [2019-12-26 22:29:47,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:47,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:29:47,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290220303] [2019-12-26 22:29:47,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:29:47,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:29:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:47,348 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-26 22:29:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:47,473 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-26 22:29:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:29:47,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:29:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:47,516 INFO L225 Difference]: With dead ends: 21037 [2019-12-26 22:29:47,517 INFO L226 Difference]: Without dead ends: 21037 [2019-12-26 22:29:47,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-26 22:29:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-26 22:29:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-26 22:29:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-26 22:29:47,968 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-26 22:29:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:47,971 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-26 22:29:47,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:29:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-26 22:29:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:29:47,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:47,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:29:47,988 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-26 22:29:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-26 22:29:47,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:47,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786171826] [2019-12-26 22:29:47,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:48,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786171826] [2019-12-26 22:29:48,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:48,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:29:48,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828056298] [2019-12-26 22:29:48,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:29:48,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:29:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:29:48,115 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-26 22:29:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:48,668 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-26 22:29:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:29:48,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:29:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:48,709 INFO L225 Difference]: With dead ends: 29609 [2019-12-26 22:29:48,709 INFO L226 Difference]: Without dead ends: 29609 [2019-12-26 22:29:48,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:29:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-26 22:29:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-26 22:29:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-26 22:29:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-26 22:29:49,247 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-26 22:29:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:49,247 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-26 22:29:49,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:29:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-26 22:29:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:29:49,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:49,261 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] [2019-12-26 22:29:49,261 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-26 22:29:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-26 22:29:49,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:49,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566193017] [2019-12-26 22:29:49,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:49,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566193017] [2019-12-26 22:29:49,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:49,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:29:49,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428336185] [2019-12-26 22:29:49,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:29:49,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:29:49,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:29:49,357 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-26 22:29:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:49,940 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-26 22:29:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:29:49,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:29:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:50,000 INFO L225 Difference]: With dead ends: 28968 [2019-12-26 22:29:50,000 INFO L226 Difference]: Without dead ends: 28968 [2019-12-26 22:29:50,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:29:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-26 22:29:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-26 22:29:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-26 22:29:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-26 22:29:50,401 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-26 22:29:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:50,401 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-26 22:29:50,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:29:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-26 22:29:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:29:50,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:50,422 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-26 22:29:50,422 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-26 22:29:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-26 22:29:50,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:50,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416547373] [2019-12-26 22:29:50,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:50,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416547373] [2019-12-26 22:29:50,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:50,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:29:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77877175] [2019-12-26 22:29:50,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:29:50,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:29:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:29:50,516 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-26 22:29:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:51,749 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-26 22:29:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:29:51,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:29:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:51,804 INFO L225 Difference]: With dead ends: 38372 [2019-12-26 22:29:51,805 INFO L226 Difference]: Without dead ends: 38372 [2019-12-26 22:29:51,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:29:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-26 22:29:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-26 22:29:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-26 22:29:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-26 22:29:52,363 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-26 22:29:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:52,363 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-26 22:29:52,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:29:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-26 22:29:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:29:52,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:52,383 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-26 22:29:52,383 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-26 22:29:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-26 22:29:52,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:52,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710115702] [2019-12-26 22:29:52,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:52,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710115702] [2019-12-26 22:29:52,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:52,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:29:52,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898614345] [2019-12-26 22:29:52,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:29:52,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:29:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:29:52,479 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-26 22:29:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:54,250 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-26 22:29:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:29:54,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 22:29:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:54,314 INFO L225 Difference]: With dead ends: 45317 [2019-12-26 22:29:54,315 INFO L226 Difference]: Without dead ends: 45317 [2019-12-26 22:29:54,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:29:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-26 22:29:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-26 22:29:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-26 22:29:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-26 22:29:54,793 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-26 22:29:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:54,793 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-26 22:29:54,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:29:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-26 22:29:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:29:54,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:54,810 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] [2019-12-26 22:29:54,810 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-26 22:29:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-26 22:29:54,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:54,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098037118] [2019-12-26 22:29:54,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:54,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098037118] [2019-12-26 22:29:54,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:54,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:29:54,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703149489] [2019-12-26 22:29:54,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:29:54,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:29:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:29:54,923 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-26 22:29:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:56,296 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-26 22:29:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:29:56,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:29:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:56,365 INFO L225 Difference]: With dead ends: 34977 [2019-12-26 22:29:56,366 INFO L226 Difference]: Without dead ends: 34977 [2019-12-26 22:29:56,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:29:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-26 22:29:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-26 22:29:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-26 22:29:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-26 22:29:56,812 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-26 22:29:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:56,813 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-26 22:29:56,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:29:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-26 22:29:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:29:56,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:56,829 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] [2019-12-26 22:29:56,830 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-26 22:29:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-26 22:29:56,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:56,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544896615] [2019-12-26 22:29:56,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:56,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544896615] [2019-12-26 22:29:56,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:56,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:29:56,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092194080] [2019-12-26 22:29:56,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:29:56,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:29:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:29:56,970 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 8 states. [2019-12-26 22:29:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:58,305 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-26 22:29:58,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:29:58,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-26 22:29:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:58,364 INFO L225 Difference]: With dead ends: 43257 [2019-12-26 22:29:58,365 INFO L226 Difference]: Without dead ends: 43257 [2019-12-26 22:29:58,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:29:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-26 22:29:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-26 22:29:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-26 22:29:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-26 22:29:58,808 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-26 22:29:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:58,809 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-26 22:29:58,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:29:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-26 22:29:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:29:58,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:58,824 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] [2019-12-26 22:29:58,824 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-26 22:29:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-26 22:29:58,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:58,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314663258] [2019-12-26 22:29:58,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:29:59,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314663258] [2019-12-26 22:29:59,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:59,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:29:59,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464903310] [2019-12-26 22:29:59,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:29:59,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:29:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:29:59,111 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 9 states. [2019-12-26 22:30:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:01,066 INFO L93 Difference]: Finished difference Result 38272 states and 111540 transitions. [2019-12-26 22:30:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:30:01,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-26 22:30:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:01,141 INFO L225 Difference]: With dead ends: 38272 [2019-12-26 22:30:01,141 INFO L226 Difference]: Without dead ends: 38272 [2019-12-26 22:30:01,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:30:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38272 states. [2019-12-26 22:30:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38272 to 17513. [2019-12-26 22:30:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17513 states. [2019-12-26 22:30:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17513 states to 17513 states and 52269 transitions. [2019-12-26 22:30:01,541 INFO L78 Accepts]: Start accepts. Automaton has 17513 states and 52269 transitions. Word has length 34 [2019-12-26 22:30:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:01,542 INFO L462 AbstractCegarLoop]: Abstraction has 17513 states and 52269 transitions. [2019-12-26 22:30:01,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:30:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17513 states and 52269 transitions. [2019-12-26 22:30:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:30:01,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:01,564 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-26 22:30:01,564 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-26 22:30:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-26 22:30:01,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:01,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507252268] [2019-12-26 22:30:01,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:01,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507252268] [2019-12-26 22:30:01,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:01,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:30:01,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132927124] [2019-12-26 22:30:01,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:01,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:01,633 INFO L87 Difference]: Start difference. First operand 17513 states and 52269 transitions. Second operand 3 states. [2019-12-26 22:30:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:01,701 INFO L93 Difference]: Finished difference Result 17512 states and 52267 transitions. [2019-12-26 22:30:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:01,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:30:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:01,735 INFO L225 Difference]: With dead ends: 17512 [2019-12-26 22:30:01,735 INFO L226 Difference]: Without dead ends: 17512 [2019-12-26 22:30:01,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17512 states. [2019-12-26 22:30:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17512 to 17512. [2019-12-26 22:30:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17512 states. [2019-12-26 22:30:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17512 states to 17512 states and 52267 transitions. [2019-12-26 22:30:02,174 INFO L78 Accepts]: Start accepts. Automaton has 17512 states and 52267 transitions. Word has length 39 [2019-12-26 22:30:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:02,175 INFO L462 AbstractCegarLoop]: Abstraction has 17512 states and 52267 transitions. [2019-12-26 22:30:02,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17512 states and 52267 transitions. [2019-12-26 22:30:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:30:02,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:02,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:30:02,201 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-26 22:30:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-26 22:30:02,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:02,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210894404] [2019-12-26 22:30:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:02,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210894404] [2019-12-26 22:30:02,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:02,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:30:02,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50771562] [2019-12-26 22:30:02,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:30:02,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:30:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:30:02,279 INFO L87 Difference]: Start difference. First operand 17512 states and 52267 transitions. Second operand 5 states. [2019-12-26 22:30:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:02,363 INFO L93 Difference]: Finished difference Result 16301 states and 49521 transitions. [2019-12-26 22:30:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:30:02,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:30:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:02,388 INFO L225 Difference]: With dead ends: 16301 [2019-12-26 22:30:02,388 INFO L226 Difference]: Without dead ends: 16301 [2019-12-26 22:30:02,389 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-26 22:30:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16301 states. [2019-12-26 22:30:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16301 to 15517. [2019-12-26 22:30:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15517 states. [2019-12-26 22:30:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 47407 transitions. [2019-12-26 22:30:02,810 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 47407 transitions. Word has length 40 [2019-12-26 22:30:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:02,810 INFO L462 AbstractCegarLoop]: Abstraction has 15517 states and 47407 transitions. [2019-12-26 22:30:02,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:30:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 47407 transitions. [2019-12-26 22:30:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:30:02,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:02,832 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-26 22:30:02,832 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-26 22:30:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-26 22:30:02,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:02,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337693691] [2019-12-26 22:30:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:03,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337693691] [2019-12-26 22:30:03,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:03,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:30:03,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603020853] [2019-12-26 22:30:03,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:30:03,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:30:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:30:03,021 INFO L87 Difference]: Start difference. First operand 15517 states and 47407 transitions. Second operand 9 states. [2019-12-26 22:30:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:04,416 INFO L93 Difference]: Finished difference Result 85582 states and 256986 transitions. [2019-12-26 22:30:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:30:04,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:30:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:04,531 INFO L225 Difference]: With dead ends: 85582 [2019-12-26 22:30:04,532 INFO L226 Difference]: Without dead ends: 77550 [2019-12-26 22:30:04,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:30:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77550 states. [2019-12-26 22:30:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77550 to 16852. [2019-12-26 22:30:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2019-12-26 22:30:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 51797 transitions. [2019-12-26 22:30:05,332 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 51797 transitions. Word has length 64 [2019-12-26 22:30:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:05,332 INFO L462 AbstractCegarLoop]: Abstraction has 16852 states and 51797 transitions. [2019-12-26 22:30:05,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:30:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 51797 transitions. [2019-12-26 22:30:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:30:05,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:05,351 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-26 22:30:05,351 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-26 22:30:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-26 22:30:05,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:05,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841893097] [2019-12-26 22:30:05,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:05,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841893097] [2019-12-26 22:30:05,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:05,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:30:05,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016263963] [2019-12-26 22:30:05,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:30:05,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:30:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:30:05,495 INFO L87 Difference]: Start difference. First operand 16852 states and 51797 transitions. Second operand 9 states. [2019-12-26 22:30:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:07,373 INFO L93 Difference]: Finished difference Result 98752 states and 294963 transitions. [2019-12-26 22:30:07,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 22:30:07,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:30:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:07,470 INFO L225 Difference]: With dead ends: 98752 [2019-12-26 22:30:07,470 INFO L226 Difference]: Without dead ends: 67988 [2019-12-26 22:30:07,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 22:30:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67988 states. [2019-12-26 22:30:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67988 to 18734. [2019-12-26 22:30:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18734 states. [2019-12-26 22:30:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18734 states to 18734 states and 57660 transitions. [2019-12-26 22:30:08,120 INFO L78 Accepts]: Start accepts. Automaton has 18734 states and 57660 transitions. Word has length 64 [2019-12-26 22:30:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:08,120 INFO L462 AbstractCegarLoop]: Abstraction has 18734 states and 57660 transitions. [2019-12-26 22:30:08,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:30:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18734 states and 57660 transitions. [2019-12-26 22:30:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:30:08,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:08,139 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-26 22:30:08,139 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-26 22:30:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-26 22:30:08,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:08,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289273532] [2019-12-26 22:30:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:08,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289273532] [2019-12-26 22:30:08,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:08,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:30:08,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147352578] [2019-12-26 22:30:08,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:30:08,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:30:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:30:08,222 INFO L87 Difference]: Start difference. First operand 18734 states and 57660 transitions. Second operand 7 states. [2019-12-26 22:30:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:08,709 INFO L93 Difference]: Finished difference Result 49627 states and 150323 transitions. [2019-12-26 22:30:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:30:08,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:30:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:08,763 INFO L225 Difference]: With dead ends: 49627 [2019-12-26 22:30:08,763 INFO L226 Difference]: Without dead ends: 38205 [2019-12-26 22:30:08,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:30:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38205 states. [2019-12-26 22:30:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38205 to 22755. [2019-12-26 22:30:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22755 states. [2019-12-26 22:30:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22755 states to 22755 states and 70086 transitions. [2019-12-26 22:30:09,239 INFO L78 Accepts]: Start accepts. Automaton has 22755 states and 70086 transitions. Word has length 64 [2019-12-26 22:30:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:09,239 INFO L462 AbstractCegarLoop]: Abstraction has 22755 states and 70086 transitions. [2019-12-26 22:30:09,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:30:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22755 states and 70086 transitions. [2019-12-26 22:30:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:30:09,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:09,266 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-26 22:30:09,266 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-26 22:30:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-26 22:30:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:09,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716041845] [2019-12-26 22:30:09,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:09,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716041845] [2019-12-26 22:30:09,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:09,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:30:09,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473405692] [2019-12-26 22:30:09,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:30:09,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:30:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:30:09,516 INFO L87 Difference]: Start difference. First operand 22755 states and 70086 transitions. Second operand 7 states. [2019-12-26 22:30:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:09,996 INFO L93 Difference]: Finished difference Result 47785 states and 143334 transitions. [2019-12-26 22:30:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:30:09,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:30:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:10,073 INFO L225 Difference]: With dead ends: 47785 [2019-12-26 22:30:10,073 INFO L226 Difference]: Without dead ends: 40903 [2019-12-26 22:30:10,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:30:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40903 states. [2019-12-26 22:30:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40903 to 23051. [2019-12-26 22:30:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23051 states. [2019-12-26 22:30:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 70938 transitions. [2019-12-26 22:30:10,594 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 70938 transitions. Word has length 64 [2019-12-26 22:30:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:10,594 INFO L462 AbstractCegarLoop]: Abstraction has 23051 states and 70938 transitions. [2019-12-26 22:30:10,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:30:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 70938 transitions. [2019-12-26 22:30:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:30:10,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:10,617 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-26 22:30:10,618 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-26 22:30:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-26 22:30:10,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:10,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847013474] [2019-12-26 22:30:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:10,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-26 22:30:10,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847013474] [2019-12-26 22:30:10,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:10,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:10,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452677559] [2019-12-26 22:30:10,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:10,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:10,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:10,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:10,689 INFO L87 Difference]: Start difference. First operand 23051 states and 70938 transitions. Second operand 3 states. [2019-12-26 22:30:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:10,822 INFO L93 Difference]: Finished difference Result 26790 states and 82248 transitions. [2019-12-26 22:30:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:10,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:30:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:10,859 INFO L225 Difference]: With dead ends: 26790 [2019-12-26 22:30:10,859 INFO L226 Difference]: Without dead ends: 26790 [2019-12-26 22:30:10,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26790 states. [2019-12-26 22:30:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26790 to 23738. [2019-12-26 22:30:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23738 states. [2019-12-26 22:30:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23738 states to 23738 states and 73243 transitions. [2019-12-26 22:30:11,240 INFO L78 Accepts]: Start accepts. Automaton has 23738 states and 73243 transitions. Word has length 64 [2019-12-26 22:30:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:11,240 INFO L462 AbstractCegarLoop]: Abstraction has 23738 states and 73243 transitions. [2019-12-26 22:30:11,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 23738 states and 73243 transitions. [2019-12-26 22:30:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:30:11,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:11,264 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-26 22:30:11,265 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-26 22:30:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-26 22:30:11,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:11,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432393199] [2019-12-26 22:30:11,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:11,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432393199] [2019-12-26 22:30:11,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:11,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:30:11,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615697248] [2019-12-26 22:30:11,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:11,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:11,311 INFO L87 Difference]: Start difference. First operand 23738 states and 73243 transitions. Second operand 3 states. [2019-12-26 22:30:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:11,538 INFO L93 Difference]: Finished difference Result 31700 states and 98003 transitions. [2019-12-26 22:30:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:11,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:30:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:11,584 INFO L225 Difference]: With dead ends: 31700 [2019-12-26 22:30:11,587 INFO L226 Difference]: Without dead ends: 31700 [2019-12-26 22:30:11,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31700 states. [2019-12-26 22:30:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31700 to 24294. [2019-12-26 22:30:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24294 states. [2019-12-26 22:30:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24294 states to 24294 states and 74989 transitions. [2019-12-26 22:30:12,159 INFO L78 Accepts]: Start accepts. Automaton has 24294 states and 74989 transitions. Word has length 65 [2019-12-26 22:30:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:12,159 INFO L462 AbstractCegarLoop]: Abstraction has 24294 states and 74989 transitions. [2019-12-26 22:30:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24294 states and 74989 transitions. [2019-12-26 22:30:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:30:12,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:12,186 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-26 22:30:12,186 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-26 22:30:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-26 22:30:12,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:12,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515954056] [2019-12-26 22:30:12,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:12,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515954056] [2019-12-26 22:30:12,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:12,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:30:12,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101845754] [2019-12-26 22:30:12,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:30:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:30:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:30:12,341 INFO L87 Difference]: Start difference. First operand 24294 states and 74989 transitions. Second operand 9 states. [2019-12-26 22:30:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:13,891 INFO L93 Difference]: Finished difference Result 83174 states and 247830 transitions. [2019-12-26 22:30:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:30:13,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:30:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:14,051 INFO L225 Difference]: With dead ends: 83174 [2019-12-26 22:30:14,052 INFO L226 Difference]: Without dead ends: 75908 [2019-12-26 22:30:14,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:30:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75908 states. [2019-12-26 22:30:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75908 to 25141. [2019-12-26 22:30:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25141 states. [2019-12-26 22:30:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25141 states to 25141 states and 77461 transitions. [2019-12-26 22:30:15,030 INFO L78 Accepts]: Start accepts. Automaton has 25141 states and 77461 transitions. Word has length 65 [2019-12-26 22:30:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:15,031 INFO L462 AbstractCegarLoop]: Abstraction has 25141 states and 77461 transitions. [2019-12-26 22:30:15,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:30:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 25141 states and 77461 transitions. [2019-12-26 22:30:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:30:15,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:15,058 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-26 22:30:15,059 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-26 22:30:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2044306796, now seen corresponding path program 2 times [2019-12-26 22:30:15,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:15,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275929638] [2019-12-26 22:30:15,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:15,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275929638] [2019-12-26 22:30:15,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:15,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:30:15,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371120592] [2019-12-26 22:30:15,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:30:15,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:15,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:30:15,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:30:15,166 INFO L87 Difference]: Start difference. First operand 25141 states and 77461 transitions. Second operand 9 states. [2019-12-26 22:30:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:16,428 INFO L93 Difference]: Finished difference Result 71646 states and 213300 transitions. [2019-12-26 22:30:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:30:16,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:30:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:16,519 INFO L225 Difference]: With dead ends: 71646 [2019-12-26 22:30:16,520 INFO L226 Difference]: Without dead ends: 68496 [2019-12-26 22:30:16,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:30:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68496 states. [2019-12-26 22:30:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68496 to 23846. [2019-12-26 22:30:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23846 states. [2019-12-26 22:30:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23846 states to 23846 states and 73321 transitions. [2019-12-26 22:30:17,230 INFO L78 Accepts]: Start accepts. Automaton has 23846 states and 73321 transitions. Word has length 65 [2019-12-26 22:30:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:17,230 INFO L462 AbstractCegarLoop]: Abstraction has 23846 states and 73321 transitions. [2019-12-26 22:30:17,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:30:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 23846 states and 73321 transitions. [2019-12-26 22:30:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:30:17,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:17,254 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-26 22:30:17,254 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-26 22:30:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1227831362, now seen corresponding path program 3 times [2019-12-26 22:30:17,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:17,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654871653] [2019-12-26 22:30:17,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:17,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654871653] [2019-12-26 22:30:17,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:17,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:30:17,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517613288] [2019-12-26 22:30:17,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:30:17,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:30:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:30:17,329 INFO L87 Difference]: Start difference. First operand 23846 states and 73321 transitions. Second operand 4 states. [2019-12-26 22:30:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:17,466 INFO L93 Difference]: Finished difference Result 23568 states and 72328 transitions. [2019-12-26 22:30:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:30:17,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:30:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:17,499 INFO L225 Difference]: With dead ends: 23568 [2019-12-26 22:30:17,499 INFO L226 Difference]: Without dead ends: 23568 [2019-12-26 22:30:17,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:30:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23568 states. [2019-12-26 22:30:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23568 to 21961. [2019-12-26 22:30:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-26 22:30:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 67216 transitions. [2019-12-26 22:30:17,847 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 67216 transitions. Word has length 65 [2019-12-26 22:30:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:17,848 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 67216 transitions. [2019-12-26 22:30:17,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:30:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 67216 transitions. [2019-12-26 22:30:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:30:17,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:17,870 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-26 22:30:17,870 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-26 22:30:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1591414325, now seen corresponding path program 1 times [2019-12-26 22:30:17,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:17,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573954684] [2019-12-26 22:30:17,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:17,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573954684] [2019-12-26 22:30:17,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:17,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:17,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200083281] [2019-12-26 22:30:17,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:17,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:17,944 INFO L87 Difference]: Start difference. First operand 21961 states and 67216 transitions. Second operand 3 states. [2019-12-26 22:30:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:18,035 INFO L93 Difference]: Finished difference Result 21961 states and 67215 transitions. [2019-12-26 22:30:18,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:30:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:18,076 INFO L225 Difference]: With dead ends: 21961 [2019-12-26 22:30:18,076 INFO L226 Difference]: Without dead ends: 21961 [2019-12-26 22:30:18,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21961 states. [2019-12-26 22:30:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21961 to 19074. [2019-12-26 22:30:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19074 states. [2019-12-26 22:30:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19074 states to 19074 states and 59204 transitions. [2019-12-26 22:30:18,532 INFO L78 Accepts]: Start accepts. Automaton has 19074 states and 59204 transitions. Word has length 65 [2019-12-26 22:30:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:18,533 INFO L462 AbstractCegarLoop]: Abstraction has 19074 states and 59204 transitions. [2019-12-26 22:30:18,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 19074 states and 59204 transitions. [2019-12-26 22:30:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:30:18,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:18,553 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-26 22:30:18,553 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-26 22:30:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1016088422, now seen corresponding path program 1 times [2019-12-26 22:30:18,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:18,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457685190] [2019-12-26 22:30:18,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:30:18,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457685190] [2019-12-26 22:30:18,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:18,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:18,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112327669] [2019-12-26 22:30:18,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:18,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:18,607 INFO L87 Difference]: Start difference. First operand 19074 states and 59204 transitions. Second operand 3 states. [2019-12-26 22:30:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:18,693 INFO L93 Difference]: Finished difference Result 16559 states and 50287 transitions. [2019-12-26 22:30:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:18,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:30:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:18,726 INFO L225 Difference]: With dead ends: 16559 [2019-12-26 22:30:18,726 INFO L226 Difference]: Without dead ends: 16559 [2019-12-26 22:30:18,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16559 states. [2019-12-26 22:30:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16559 to 15183. [2019-12-26 22:30:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15183 states. [2019-12-26 22:30:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15183 states to 15183 states and 46041 transitions. [2019-12-26 22:30:19,018 INFO L78 Accepts]: Start accepts. Automaton has 15183 states and 46041 transitions. Word has length 66 [2019-12-26 22:30:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:19,018 INFO L462 AbstractCegarLoop]: Abstraction has 15183 states and 46041 transitions. [2019-12-26 22:30:19,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15183 states and 46041 transitions. [2019-12-26 22:30:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:30:19,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:19,033 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-26 22:30:19,033 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-26 22:30:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-26 22:30:19,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:19,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169632961] [2019-12-26 22:30:19,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:30:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:30:19,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:30:19,156 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:30:19,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~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_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~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, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, 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, ~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_~#t1013~0.base] because there is no mapped edge [2019-12-26 22:30:19,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out-1026363291) (= ~a$r_buff0_thd3~0_In-1026363291 ~a$r_buff1_thd3~0_Out-1026363291) (= ~a$r_buff0_thd0~0_In-1026363291 ~a$r_buff1_thd0~0_Out-1026363291) (= ~a$r_buff1_thd2~0_Out-1026363291 ~a$r_buff0_thd2~0_In-1026363291) (= 1 ~x~0_Out-1026363291) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1026363291)) (= ~a$r_buff1_thd1~0_Out-1026363291 ~a$r_buff0_thd1~0_In-1026363291)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1026363291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1026363291, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1026363291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1026363291, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1026363291} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1026363291, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1026363291, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1026363291, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1026363291, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1026363291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1026363291, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1026363291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1026363291, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1026363291, ~x~0=~x~0_Out-1026363291} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 22:30:19,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-26 22:30:19,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-26 22:30:19,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1855930481 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1855930481 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1855930481| |P1Thread1of1ForFork2_#t~ite9_Out1855930481|))) (or (and (= ~a$w_buff1~0_In1855930481 |P1Thread1of1ForFork2_#t~ite9_Out1855930481|) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1855930481| ~a~0_In1855930481) (or .cse1 .cse0) .cse2))) InVars {~a~0=~a~0_In1855930481, ~a$w_buff1~0=~a$w_buff1~0_In1855930481, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1855930481, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1855930481} OutVars{~a~0=~a~0_In1855930481, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1855930481|, ~a$w_buff1~0=~a$w_buff1~0_In1855930481, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1855930481, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1855930481|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1855930481} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:30:19,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1682944807 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1682944807 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1682944807| ~a$w_buff0_used~0_In1682944807) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1682944807|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1682944807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1682944807} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1682944807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1682944807, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1682944807|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:30:19,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd2~0_In-2004713271 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2004713271 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-2004713271 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2004713271 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-2004713271| ~a$w_buff1_used~0_In-2004713271)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-2004713271| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2004713271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2004713271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2004713271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2004713271} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2004713271, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2004713271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2004713271, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2004713271|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2004713271} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:30:19,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In663155564 256)))) (or (and (= ~a$w_buff0~0_In663155564 |P2Thread1of1ForFork0_#t~ite21_Out663155564|) (= |P2Thread1of1ForFork0_#t~ite20_In663155564| |P2Thread1of1ForFork0_#t~ite20_Out663155564|) (not .cse0)) (and (= ~a$w_buff0~0_In663155564 |P2Thread1of1ForFork0_#t~ite20_Out663155564|) (= |P2Thread1of1ForFork0_#t~ite21_Out663155564| |P2Thread1of1ForFork0_#t~ite20_Out663155564|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In663155564 256)))) (or (and (= (mod ~a$w_buff1_used~0_In663155564 256) 0) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In663155564 256)) .cse1) (= (mod ~a$w_buff0_used~0_In663155564 256) 0)))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In663155564, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663155564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663155564, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663155564, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663155564, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In663155564|, ~weak$$choice2~0=~weak$$choice2~0_In663155564} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out663155564|, ~a$w_buff0~0=~a$w_buff0~0_In663155564, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663155564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663155564, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663155564, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out663155564|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663155564, ~weak$$choice2~0=~weak$$choice2~0_In663155564} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 22:30:19,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In3469198 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In3469198 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out3469198| ~a$r_buff0_thd2~0_In3469198) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out3469198| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In3469198, ~a$w_buff0_used~0=~a$w_buff0_used~0_In3469198} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In3469198, ~a$w_buff0_used~0=~a$w_buff0_used~0_In3469198, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out3469198|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:30:19,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In2072394625 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In2072394625 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In2072394625 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In2072394625 256) 0))) (or (and (= ~a$r_buff1_thd2~0_In2072394625 |P1Thread1of1ForFork2_#t~ite14_Out2072394625|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out2072394625|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2072394625, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2072394625, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2072394625, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2072394625} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2072394625, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2072394625, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2072394625, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2072394625, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2072394625|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:30:19,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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-26 22:30:19,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In44421764 256)))) (or (and (= ~a$w_buff1~0_In44421764 |P2Thread1of1ForFork0_#t~ite24_Out44421764|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In44421764| |P2Thread1of1ForFork0_#t~ite23_Out44421764|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In44421764 256)))) (or (= (mod ~a$w_buff0_used~0_In44421764 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In44421764 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In44421764 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out44421764| |P2Thread1of1ForFork0_#t~ite24_Out44421764|) (= |P2Thread1of1ForFork0_#t~ite23_Out44421764| ~a$w_buff1~0_In44421764)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In44421764, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In44421764|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In44421764, ~a$w_buff0_used~0=~a$w_buff0_used~0_In44421764, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In44421764, ~a$w_buff1_used~0=~a$w_buff1_used~0_In44421764, ~weak$$choice2~0=~weak$$choice2~0_In44421764} OutVars{~a$w_buff1~0=~a$w_buff1~0_In44421764, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out44421764|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out44421764|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In44421764, ~a$w_buff0_used~0=~a$w_buff0_used~0_In44421764, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In44421764, ~a$w_buff1_used~0=~a$w_buff1_used~0_In44421764, ~weak$$choice2~0=~weak$$choice2~0_In44421764} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:30:19,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-214278998 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-214278998| ~a$w_buff0_used~0_In-214278998) (= |P2Thread1of1ForFork0_#t~ite26_In-214278998| |P2Thread1of1ForFork0_#t~ite26_Out-214278998|)) (and .cse0 (= ~a$w_buff0_used~0_In-214278998 |P2Thread1of1ForFork0_#t~ite26_Out-214278998|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-214278998 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-214278998 256) 0) (and (= (mod ~a$w_buff1_used~0_In-214278998 256) 0) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-214278998 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out-214278998| |P2Thread1of1ForFork0_#t~ite26_Out-214278998|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-214278998|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-214278998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-214278998, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-214278998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-214278998, ~weak$$choice2~0=~weak$$choice2~0_In-214278998} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-214278998|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-214278998|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-214278998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-214278998, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-214278998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-214278998, ~weak$$choice2~0=~weak$$choice2~0_In-214278998} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:30:19,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:30:19,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 22:30:19,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In394485828 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In394485828 256) 0))) (or (and (= ~a~0_In394485828 |P2Thread1of1ForFork0_#t~ite38_Out394485828|) (or .cse0 .cse1)) (and (not .cse1) (= ~a$w_buff1~0_In394485828 |P2Thread1of1ForFork0_#t~ite38_Out394485828|) (not .cse0)))) InVars {~a~0=~a~0_In394485828, ~a$w_buff1~0=~a$w_buff1~0_In394485828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In394485828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In394485828} OutVars{~a~0=~a~0_In394485828, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out394485828|, ~a$w_buff1~0=~a$w_buff1~0_In394485828, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In394485828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In394485828} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:30:19,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:30:19,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2002630720 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2002630720 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2002630720 |P2Thread1of1ForFork0_#t~ite40_Out-2002630720|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2002630720|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2002630720, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2002630720} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2002630720|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2002630720, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2002630720} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:30:19,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-755176662 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-755176662 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-755176662 |P0Thread1of1ForFork1_#t~ite5_Out-755176662|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-755176662| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-755176662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-755176662} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-755176662|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755176662, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-755176662} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:30:19,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1558477640 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1558477640 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-1558477640 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1558477640 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1558477640|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1558477640| ~a$w_buff1_used~0_In-1558477640) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1558477640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1558477640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1558477640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1558477640} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1558477640|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1558477640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1558477640, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1558477640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1558477640} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:30:19,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-20815847 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-20815847 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-20815847 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-20815847 ~a$r_buff0_thd1~0_In-20815847)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-20815847, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-20815847} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-20815847|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-20815847, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-20815847} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:30:19,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1740821713 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1740821713 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1740821713 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1740821713 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1740821713|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out1740821713| ~a$r_buff1_thd1~0_In1740821713)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1740821713, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1740821713, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1740821713, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1740821713} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1740821713|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1740821713, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1740821713, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1740821713, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1740821713} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:30:19,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} 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-26 22:30:19,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-719441001 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-719441001 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-719441001 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-719441001 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-719441001|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-719441001 |P2Thread1of1ForFork0_#t~ite41_Out-719441001|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-719441001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-719441001, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-719441001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-719441001} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-719441001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-719441001, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-719441001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-719441001, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-719441001|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:30:19,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1774932567 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1774932567 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1774932567| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1774932567| ~a$r_buff0_thd3~0_In1774932567)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1774932567, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1774932567} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1774932567, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1774932567, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1774932567|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:30:19,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1514180035 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1514180035 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-1514180035 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1514180035 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1514180035| ~a$r_buff1_thd3~0_In-1514180035) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1514180035| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1514180035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1514180035, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1514180035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1514180035} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1514180035|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1514180035, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1514180035, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1514180035, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1514180035} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:30:19,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, 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-26 22:30:19,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:30:19,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-160813072 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-160813072 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-160813072| |ULTIMATE.start_main_#t~ite47_Out-160813072|))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In-160813072 |ULTIMATE.start_main_#t~ite47_Out-160813072|)) (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In-160813072 |ULTIMATE.start_main_#t~ite47_Out-160813072|)))) InVars {~a~0=~a~0_In-160813072, ~a$w_buff1~0=~a$w_buff1~0_In-160813072, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-160813072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-160813072} OutVars{~a~0=~a~0_In-160813072, ~a$w_buff1~0=~a$w_buff1~0_In-160813072, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-160813072|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-160813072, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-160813072|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-160813072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:30:19,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-283491662 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-283491662 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-283491662|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-283491662| ~a$w_buff0_used~0_In-283491662) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-283491662, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-283491662} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-283491662, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-283491662|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-283491662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:30:19,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-36103993 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-36103993 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-36103993 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-36103993 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-36103993|)) (and (= ~a$w_buff1_used~0_In-36103993 |ULTIMATE.start_main_#t~ite50_Out-36103993|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-36103993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-36103993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-36103993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-36103993} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-36103993|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-36103993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-36103993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-36103993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-36103993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:30:19,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1571536244 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1571536244 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out1571536244| 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1571536244 |ULTIMATE.start_main_#t~ite51_Out1571536244|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1571536244, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1571536244} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1571536244|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1571536244, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1571536244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:30:19,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In2107772097 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In2107772097 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2107772097 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In2107772097 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out2107772097|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2107772097 |ULTIMATE.start_main_#t~ite52_Out2107772097|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2107772097, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2107772097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2107772097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2107772097} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2107772097|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2107772097, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2107772097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2107772097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2107772097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:30:19,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-26 22:30:19,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:30:19 BasicIcfg [2019-12-26 22:30:19,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:30:19,296 INFO L168 Benchmark]: Toolchain (without parser) took 90842.06 ms. Allocated memory was 144.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 100.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 925.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,296 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.69 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 154.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,298 INFO L168 Benchmark]: Boogie Preprocessor took 51.25 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,298 INFO L168 Benchmark]: RCFGBuilder took 883.57 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,299 INFO L168 Benchmark]: TraceAbstraction took 88970.93 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 867.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:30:19,302 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.69 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 154.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.25 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.57 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88970.93 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 867.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0] [L768] EXPR 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_p1_EAX=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=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 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) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 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)) [L770] 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 [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 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)) [L798] 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)) [L799] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=0, x=2, y=1, z=1] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=2, y=1, z=1] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 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) [L807] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 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 [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 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 [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 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) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6564 SDtfs, 9442 SDslu, 18335 SDs, 0 SdLazy, 10018 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 32.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 424056 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 190270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...