/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:34:23,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:34:23,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:34:23,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:34:23,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:34:23,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:34:23,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:34:23,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:34:23,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:34:23,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:34:23,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:34:23,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:34:23,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:34:23,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:34:23,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:34:23,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:34:23,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:34:23,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:34:23,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:34:23,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:34:23,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:34:23,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:34:23,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:34:23,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:34:23,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:34:23,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:34:23,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:34:23,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:34:23,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:34:23,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:34:23,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:34:23,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:34:23,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:34:23,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:34:23,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:34:23,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:34:23,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:34:23,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:34:23,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:34:23,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:34:23,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:34:23,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:34:23,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:34:23,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:34:23,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:34:23,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:34:23,236 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:34:23,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:34:23,236 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:34:23,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:34:23,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:34:23,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:34:23,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:34:23,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:34:23,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:34:23,239 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:34:23,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:34:23,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:34:23,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:34:23,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:34:23,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:34:23,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:34:23,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:34:23,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:34:23,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:34:23,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:34:23,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:34:23,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:34:23,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:34:23,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:34:23,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:34:23,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:34:23,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:34:23,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:34:23,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:34:23,567 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:34:23,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-18 18:34:23,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aef1bda/9a1261969e3142de9be1606e2fba6b9f/FLAGf79558915 [2019-12-18 18:34:24,197 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:34:24,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-18 18:34:24,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aef1bda/9a1261969e3142de9be1606e2fba6b9f/FLAGf79558915 [2019-12-18 18:34:24,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68aef1bda/9a1261969e3142de9be1606e2fba6b9f [2019-12-18 18:34:24,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:34:24,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:34:24,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:34:24,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:34:24,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:34:24,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:34:24" (1/1) ... [2019-12-18 18:34:24,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a840ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:24, skipping insertion in model container [2019-12-18 18:34:24,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:34:24" (1/1) ... [2019-12-18 18:34:24,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:34:24,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:34:25,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:34:25,061 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:34:25,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:34:25,224 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:34:25,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25 WrapperNode [2019-12-18 18:34:25,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:34:25,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:34:25,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:34:25,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:34:25,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:34:25,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:34:25,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:34:25,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:34:25,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... [2019-12-18 18:34:25,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:34:25,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:34:25,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:34:25,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:34:25,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:34:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:34:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:34:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:34:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:34:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:34:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:34:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:34:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:34:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:34:25,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:34:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:34:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:34:25,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:34:25,400 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:34:26,126 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:34:26,127 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:34:26,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:34:26 BoogieIcfgContainer [2019-12-18 18:34:26,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:34:26,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:34:26,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:34:26,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:34:26,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:34:24" (1/3) ... [2019-12-18 18:34:26,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c151fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:34:26, skipping insertion in model container [2019-12-18 18:34:26,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:34:25" (2/3) ... [2019-12-18 18:34:26,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c151fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:34:26, skipping insertion in model container [2019-12-18 18:34:26,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:34:26" (3/3) ... [2019-12-18 18:34:26,137 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2019-12-18 18:34:26,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:34:26,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:34:26,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:34:26,158 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:34:26,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,234 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,281 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:34:26,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:34:26,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:34:26,321 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:34:26,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:34:26,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:34:26,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:34:26,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:34:26,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:34:26,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:34:26,337 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 18:34:26,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:34:26,425 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:34:26,425 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:34:26,447 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:34:26,475 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 18:34:26,555 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 18:34:26,556 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:34:26,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:34:26,587 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:34:26,589 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:34:31,720 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-18 18:34:32,017 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:34:32,161 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:34:32,262 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-18 18:34:32,262 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 18:34:32,266 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-18 18:34:42,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-18 18:34:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-18 18:34:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:34:42,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:42,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:34:42,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-18 18:34:42,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:42,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92904873] [2019-12-18 18:34:42,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:42,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92904873] [2019-12-18 18:34:42,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:42,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:34:42,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084269379] [2019-12-18 18:34:42,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:42,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:42,976 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-18 18:34:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:43,754 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-18 18:34:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:43,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:34:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:46,564 INFO L225 Difference]: With dead ends: 79136 [2019-12-18 18:34:46,565 INFO L226 Difference]: Without dead ends: 74600 [2019-12-18 18:34:46,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-18 18:34:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-18 18:34:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-18 18:34:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-18 18:34:52,055 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-18 18:34:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:52,056 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-18 18:34:52,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-18 18:34:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:34:52,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:52,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:52,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-18 18:34:52,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:52,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461842837] [2019-12-18 18:34:52,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:52,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461842837] [2019-12-18 18:34:52,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:52,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:52,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111103890] [2019-12-18 18:34:52,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:34:52,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:52,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:34:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:52,238 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-18 18:34:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:56,313 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-18 18:34:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:34:56,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:34:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:56,810 INFO L225 Difference]: With dead ends: 114840 [2019-12-18 18:34:56,810 INFO L226 Difference]: Without dead ends: 114749 [2019-12-18 18:34:56,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-18 18:35:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-18 18:35:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-18 18:35:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-18 18:35:09,196 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-18 18:35:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:09,197 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-18 18:35:09,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:35:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-18 18:35:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:35:09,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:09,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:09,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-18 18:35:09,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:09,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515817730] [2019-12-18 18:35:09,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:09,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515817730] [2019-12-18 18:35:09,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:09,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:35:09,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165761969] [2019-12-18 18:35:09,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:35:09,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:35:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:35:09,270 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-18 18:35:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:10,250 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-18 18:35:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:35:10,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:35:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:11,627 INFO L225 Difference]: With dead ends: 148763 [2019-12-18 18:35:11,628 INFO L226 Difference]: Without dead ends: 148659 [2019-12-18 18:35:11,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-18 18:35:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-18 18:35:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-18 18:35:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-18 18:35:18,930 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-18 18:35:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:18,931 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-18 18:35:18,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:35:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-18 18:35:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:35:18,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:18,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:18,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-18 18:35:18,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:18,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642960053] [2019-12-18 18:35:18,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:19,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642960053] [2019-12-18 18:35:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:35:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671070753] [2019-12-18 18:35:19,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:35:19,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:35:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:19,024 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-18 18:35:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:21,009 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-18 18:35:21,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:35:21,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:35:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:27,239 INFO L225 Difference]: With dead ends: 172949 [2019-12-18 18:35:27,240 INFO L226 Difference]: Without dead ends: 172813 [2019-12-18 18:35:27,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:35:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-18 18:35:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-18 18:35:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-18 18:35:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-18 18:35:33,268 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-18 18:35:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:33,268 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-18 18:35:33,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:35:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-18 18:35:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 18:35:33,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:33,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:33,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-18 18:35:33,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:33,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517522710] [2019-12-18 18:35:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:33,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517522710] [2019-12-18 18:35:33,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:33,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:35:33,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786880502] [2019-12-18 18:35:33,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:35:33,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:35:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:33,361 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-18 18:35:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:34,946 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-18 18:35:34,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:35:34,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 18:35:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:35,353 INFO L225 Difference]: With dead ends: 133799 [2019-12-18 18:35:35,354 INFO L226 Difference]: Without dead ends: 133799 [2019-12-18 18:35:35,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:35:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-18 18:35:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-18 18:35:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-18 18:35:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-18 18:35:46,274 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-18 18:35:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:46,275 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-18 18:35:46,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:35:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-18 18:35:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:35:46,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:46,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:46,298 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-18 18:35:46,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:46,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718747066] [2019-12-18 18:35:46,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:46,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718747066] [2019-12-18 18:35:46,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:46,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:35:46,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626222231] [2019-12-18 18:35:46,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:35:46,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:35:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:35:46,385 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-18 18:35:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:52,227 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-18 18:35:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:35:52,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:35:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:52,634 INFO L225 Difference]: With dead ends: 243998 [2019-12-18 18:35:52,634 INFO L226 Difference]: Without dead ends: 133380 [2019-12-18 18:35:52,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-18 18:35:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-18 18:35:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-18 18:35:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-18 18:35:59,277 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-18 18:35:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:35:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-18 18:35:59,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:35:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-18 18:35:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:35:59,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:35:59,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:35:59,292 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:35:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:35:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-18 18:35:59,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:35:59,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125567067] [2019-12-18 18:35:59,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:35:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:35:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:35:59,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125567067] [2019-12-18 18:35:59,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:35:59,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:35:59,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175219707] [2019-12-18 18:35:59,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:35:59,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:35:59,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:35:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:35:59,386 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 4 states. [2019-12-18 18:35:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:35:59,551 INFO L93 Difference]: Finished difference Result 37959 states and 130542 transitions. [2019-12-18 18:35:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:35:59,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 18:35:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:35:59,605 INFO L225 Difference]: With dead ends: 37959 [2019-12-18 18:35:59,606 INFO L226 Difference]: Without dead ends: 29867 [2019-12-18 18:35:59,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:35:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29867 states. [2019-12-18 18:36:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29867 to 29503. [2019-12-18 18:36:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29503 states. [2019-12-18 18:36:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29503 states to 29503 states and 97874 transitions. [2019-12-18 18:36:04,479 INFO L78 Accepts]: Start accepts. Automaton has 29503 states and 97874 transitions. Word has length 19 [2019-12-18 18:36:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:04,480 INFO L462 AbstractCegarLoop]: Abstraction has 29503 states and 97874 transitions. [2019-12-18 18:36:04,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:36:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29503 states and 97874 transitions. [2019-12-18 18:36:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:36:04,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:04,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:04,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-18 18:36:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:04,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635164171] [2019-12-18 18:36:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635164171] [2019-12-18 18:36:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:04,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:36:04,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139219180] [2019-12-18 18:36:04,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:36:04,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:36:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:36:04,603 INFO L87 Difference]: Start difference. First operand 29503 states and 97874 transitions. Second operand 6 states. [2019-12-18 18:36:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:05,474 INFO L93 Difference]: Finished difference Result 45998 states and 148304 transitions. [2019-12-18 18:36:05,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:36:05,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:36:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:05,564 INFO L225 Difference]: With dead ends: 45998 [2019-12-18 18:36:05,564 INFO L226 Difference]: Without dead ends: 45401 [2019-12-18 18:36:05,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:36:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45401 states. [2019-12-18 18:36:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45401 to 29690. [2019-12-18 18:36:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29690 states. [2019-12-18 18:36:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29690 states to 29690 states and 97640 transitions. [2019-12-18 18:36:06,188 INFO L78 Accepts]: Start accepts. Automaton has 29690 states and 97640 transitions. Word has length 22 [2019-12-18 18:36:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:06,188 INFO L462 AbstractCegarLoop]: Abstraction has 29690 states and 97640 transitions. [2019-12-18 18:36:06,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:36:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 29690 states and 97640 transitions. [2019-12-18 18:36:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:36:06,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:06,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:06,197 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1172052689, now seen corresponding path program 1 times [2019-12-18 18:36:06,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:06,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492925010] [2019-12-18 18:36:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:06,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492925010] [2019-12-18 18:36:06,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:06,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:36:06,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780365934] [2019-12-18 18:36:06,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:36:06,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:36:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:36:06,289 INFO L87 Difference]: Start difference. First operand 29690 states and 97640 transitions. Second operand 5 states. [2019-12-18 18:36:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:06,405 INFO L93 Difference]: Finished difference Result 12490 states and 37892 transitions. [2019-12-18 18:36:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:36:06,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:36:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:06,429 INFO L225 Difference]: With dead ends: 12490 [2019-12-18 18:36:06,429 INFO L226 Difference]: Without dead ends: 10440 [2019-12-18 18:36:06,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:36:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-12-18 18:36:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10344. [2019-12-18 18:36:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10344 states. [2019-12-18 18:36:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10344 states to 10344 states and 31050 transitions. [2019-12-18 18:36:06,582 INFO L78 Accepts]: Start accepts. Automaton has 10344 states and 31050 transitions. Word has length 25 [2019-12-18 18:36:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:06,582 INFO L462 AbstractCegarLoop]: Abstraction has 10344 states and 31050 transitions. [2019-12-18 18:36:06,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:36:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 10344 states and 31050 transitions. [2019-12-18 18:36:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:36:06,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:06,868 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-18 18:36:06,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:06,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023107217] [2019-12-18 18:36:06,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:07,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023107217] [2019-12-18 18:36:07,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:07,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:36:07,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303508909] [2019-12-18 18:36:07,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:36:07,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:36:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:36:07,031 INFO L87 Difference]: Start difference. First operand 10344 states and 31050 transitions. Second operand 7 states. [2019-12-18 18:36:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:08,077 INFO L93 Difference]: Finished difference Result 13227 states and 38318 transitions. [2019-12-18 18:36:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:36:08,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 18:36:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:08,096 INFO L225 Difference]: With dead ends: 13227 [2019-12-18 18:36:08,096 INFO L226 Difference]: Without dead ends: 12669 [2019-12-18 18:36:08,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:36:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12669 states. [2019-12-18 18:36:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12669 to 10096. [2019-12-18 18:36:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10096 states. [2019-12-18 18:36:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10096 states to 10096 states and 30547 transitions. [2019-12-18 18:36:08,253 INFO L78 Accepts]: Start accepts. Automaton has 10096 states and 30547 transitions. Word has length 40 [2019-12-18 18:36:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:08,254 INFO L462 AbstractCegarLoop]: Abstraction has 10096 states and 30547 transitions. [2019-12-18 18:36:08,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:36:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 10096 states and 30547 transitions. [2019-12-18 18:36:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:36:08,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:08,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:08,268 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2120639963, now seen corresponding path program 1 times [2019-12-18 18:36:08,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:08,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964888438] [2019-12-18 18:36:08,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:08,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-18 18:36:08,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964888438] [2019-12-18 18:36:08,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:08,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:36:08,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128387165] [2019-12-18 18:36:08,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:36:08,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:36:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:36:08,357 INFO L87 Difference]: Start difference. First operand 10096 states and 30547 transitions. Second operand 5 states. [2019-12-18 18:36:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:08,860 INFO L93 Difference]: Finished difference Result 14736 states and 44217 transitions. [2019-12-18 18:36:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:36:08,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:36:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:08,883 INFO L225 Difference]: With dead ends: 14736 [2019-12-18 18:36:08,883 INFO L226 Difference]: Without dead ends: 14736 [2019-12-18 18:36:08,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:36:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-18 18:36:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13574. [2019-12-18 18:36:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13574 states. [2019-12-18 18:36:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13574 states to 13574 states and 40979 transitions. [2019-12-18 18:36:09,079 INFO L78 Accepts]: Start accepts. Automaton has 13574 states and 40979 transitions. Word has length 40 [2019-12-18 18:36:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:09,079 INFO L462 AbstractCegarLoop]: Abstraction has 13574 states and 40979 transitions. [2019-12-18 18:36:09,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:36:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13574 states and 40979 transitions. [2019-12-18 18:36:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:36:09,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:09,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:09,099 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 949732641, now seen corresponding path program 2 times [2019-12-18 18:36:09,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:09,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444506788] [2019-12-18 18:36:09,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:09,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444506788] [2019-12-18 18:36:09,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:09,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:36:09,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430769191] [2019-12-18 18:36:09,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:36:09,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:36:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:36:09,201 INFO L87 Difference]: Start difference. First operand 13574 states and 40979 transitions. Second operand 6 states. [2019-12-18 18:36:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:09,856 INFO L93 Difference]: Finished difference Result 24689 states and 74817 transitions. [2019-12-18 18:36:09,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:36:09,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 18:36:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:09,893 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 18:36:09,893 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 18:36:09,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:36:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 18:36:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 15538. [2019-12-18 18:36:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15538 states. [2019-12-18 18:36:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15538 states to 15538 states and 47173 transitions. [2019-12-18 18:36:10,388 INFO L78 Accepts]: Start accepts. Automaton has 15538 states and 47173 transitions. Word has length 40 [2019-12-18 18:36:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:10,388 INFO L462 AbstractCegarLoop]: Abstraction has 15538 states and 47173 transitions. [2019-12-18 18:36:10,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:36:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15538 states and 47173 transitions. [2019-12-18 18:36:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:36:10,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:10,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:10,406 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash -664415049, now seen corresponding path program 3 times [2019-12-18 18:36:10,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:10,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093296328] [2019-12-18 18:36:10,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:10,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093296328] [2019-12-18 18:36:10,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:10,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:36:10,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76278796] [2019-12-18 18:36:10,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:36:10,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:10,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:36:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:10,488 INFO L87 Difference]: Start difference. First operand 15538 states and 47173 transitions. Second operand 3 states. [2019-12-18 18:36:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:10,557 INFO L93 Difference]: Finished difference Result 12844 states and 38227 transitions. [2019-12-18 18:36:10,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:36:10,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 18:36:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:10,580 INFO L225 Difference]: With dead ends: 12844 [2019-12-18 18:36:10,581 INFO L226 Difference]: Without dead ends: 12844 [2019-12-18 18:36:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2019-12-18 18:36:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12796. [2019-12-18 18:36:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12796 states. [2019-12-18 18:36:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12796 states to 12796 states and 38103 transitions. [2019-12-18 18:36:10,806 INFO L78 Accepts]: Start accepts. Automaton has 12796 states and 38103 transitions. Word has length 40 [2019-12-18 18:36:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:10,807 INFO L462 AbstractCegarLoop]: Abstraction has 12796 states and 38103 transitions. [2019-12-18 18:36:10,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:36:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12796 states and 38103 transitions. [2019-12-18 18:36:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 18:36:10,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:10,820 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] [2019-12-18 18:36:10,820 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1595396635, now seen corresponding path program 1 times [2019-12-18 18:36:10,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:10,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042652437] [2019-12-18 18:36:10,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:10,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042652437] [2019-12-18 18:36:10,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:10,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:36:10,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725330536] [2019-12-18 18:36:10,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:36:10,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:10,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:36:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:36:10,899 INFO L87 Difference]: Start difference. First operand 12796 states and 38103 transitions. Second operand 6 states. [2019-12-18 18:36:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:12,029 INFO L93 Difference]: Finished difference Result 17701 states and 52041 transitions. [2019-12-18 18:36:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:36:12,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 18:36:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:12,064 INFO L225 Difference]: With dead ends: 17701 [2019-12-18 18:36:12,064 INFO L226 Difference]: Without dead ends: 17701 [2019-12-18 18:36:12,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:36:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17701 states. [2019-12-18 18:36:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17701 to 13532. [2019-12-18 18:36:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13532 states. [2019-12-18 18:36:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13532 states to 13532 states and 40342 transitions. [2019-12-18 18:36:12,317 INFO L78 Accepts]: Start accepts. Automaton has 13532 states and 40342 transitions. Word has length 41 [2019-12-18 18:36:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:12,317 INFO L462 AbstractCegarLoop]: Abstraction has 13532 states and 40342 transitions. [2019-12-18 18:36:12,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:36:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13532 states and 40342 transitions. [2019-12-18 18:36:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 18:36:12,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:12,332 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] [2019-12-18 18:36:12,332 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -211129485, now seen corresponding path program 2 times [2019-12-18 18:36:12,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:12,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246264627] [2019-12-18 18:36:12,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:12,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246264627] [2019-12-18 18:36:12,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:12,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:36:12,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308303206] [2019-12-18 18:36:12,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:36:12,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:36:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:36:12,410 INFO L87 Difference]: Start difference. First operand 13532 states and 40342 transitions. Second operand 6 states. [2019-12-18 18:36:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:12,522 INFO L93 Difference]: Finished difference Result 12246 states and 37116 transitions. [2019-12-18 18:36:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:36:12,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 18:36:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:12,540 INFO L225 Difference]: With dead ends: 12246 [2019-12-18 18:36:12,540 INFO L226 Difference]: Without dead ends: 12050 [2019-12-18 18:36:12,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:36:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2019-12-18 18:36:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 10964. [2019-12-18 18:36:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10964 states. [2019-12-18 18:36:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 33549 transitions. [2019-12-18 18:36:12,708 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 33549 transitions. Word has length 41 [2019-12-18 18:36:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:12,708 INFO L462 AbstractCegarLoop]: Abstraction has 10964 states and 33549 transitions. [2019-12-18 18:36:12,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:36:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 33549 transitions. [2019-12-18 18:36:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:12,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:12,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:12,722 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1533364152, now seen corresponding path program 1 times [2019-12-18 18:36:12,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:12,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062173215] [2019-12-18 18:36:12,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:12,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062173215] [2019-12-18 18:36:12,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:12,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:36:12,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516792661] [2019-12-18 18:36:12,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:36:12,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:36:12,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:12,764 INFO L87 Difference]: Start difference. First operand 10964 states and 33549 transitions. Second operand 3 states. [2019-12-18 18:36:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:12,848 INFO L93 Difference]: Finished difference Result 15249 states and 45901 transitions. [2019-12-18 18:36:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:36:12,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:36:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:12,876 INFO L225 Difference]: With dead ends: 15249 [2019-12-18 18:36:12,877 INFO L226 Difference]: Without dead ends: 15249 [2019-12-18 18:36:12,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15249 states. [2019-12-18 18:36:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15249 to 12402. [2019-12-18 18:36:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12402 states. [2019-12-18 18:36:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12402 states to 12402 states and 37793 transitions. [2019-12-18 18:36:13,226 INFO L78 Accepts]: Start accepts. Automaton has 12402 states and 37793 transitions. Word has length 55 [2019-12-18 18:36:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:13,226 INFO L462 AbstractCegarLoop]: Abstraction has 12402 states and 37793 transitions. [2019-12-18 18:36:13,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:36:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 12402 states and 37793 transitions. [2019-12-18 18:36:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:13,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:13,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:13,245 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 151400898, now seen corresponding path program 1 times [2019-12-18 18:36:13,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:13,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084658680] [2019-12-18 18:36:13,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:13,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084658680] [2019-12-18 18:36:13,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:13,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:36:13,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591060473] [2019-12-18 18:36:13,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:36:13,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:13,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:36:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:36:13,344 INFO L87 Difference]: Start difference. First operand 12402 states and 37793 transitions. Second operand 7 states. [2019-12-18 18:36:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:14,310 INFO L93 Difference]: Finished difference Result 19949 states and 59265 transitions. [2019-12-18 18:36:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:36:14,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 18:36:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:14,337 INFO L225 Difference]: With dead ends: 19949 [2019-12-18 18:36:14,337 INFO L226 Difference]: Without dead ends: 19949 [2019-12-18 18:36:14,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:36:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19949 states. [2019-12-18 18:36:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19949 to 12936. [2019-12-18 18:36:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12936 states. [2019-12-18 18:36:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12936 states to 12936 states and 39374 transitions. [2019-12-18 18:36:14,579 INFO L78 Accepts]: Start accepts. Automaton has 12936 states and 39374 transitions. Word has length 55 [2019-12-18 18:36:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:14,579 INFO L462 AbstractCegarLoop]: Abstraction has 12936 states and 39374 transitions. [2019-12-18 18:36:14,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:36:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12936 states and 39374 transitions. [2019-12-18 18:36:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:14,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:14,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:14,594 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1352181296, now seen corresponding path program 2 times [2019-12-18 18:36:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:14,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075532599] [2019-12-18 18:36:14,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:14,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075532599] [2019-12-18 18:36:14,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:14,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:36:14,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995484361] [2019-12-18 18:36:14,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:36:14,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:14,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:36:14,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:36:14,726 INFO L87 Difference]: Start difference. First operand 12936 states and 39374 transitions. Second operand 9 states. [2019-12-18 18:36:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:16,970 INFO L93 Difference]: Finished difference Result 18557 states and 55268 transitions. [2019-12-18 18:36:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 18:36:16,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 18:36:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:16,994 INFO L225 Difference]: With dead ends: 18557 [2019-12-18 18:36:16,994 INFO L226 Difference]: Without dead ends: 18557 [2019-12-18 18:36:16,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 18:36:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18557 states. [2019-12-18 18:36:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18557 to 11324. [2019-12-18 18:36:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-18 18:36:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 34631 transitions. [2019-12-18 18:36:17,183 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 34631 transitions. Word has length 55 [2019-12-18 18:36:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:17,184 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 34631 transitions. [2019-12-18 18:36:17,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:36:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 34631 transitions. [2019-12-18 18:36:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:17,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:17,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:17,195 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1280273460, now seen corresponding path program 3 times [2019-12-18 18:36:17,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:17,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342605399] [2019-12-18 18:36:17,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:17,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342605399] [2019-12-18 18:36:17,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:17,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:36:17,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130949905] [2019-12-18 18:36:17,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:36:17,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:36:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:36:17,469 INFO L87 Difference]: Start difference. First operand 11324 states and 34631 transitions. Second operand 9 states. [2019-12-18 18:36:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:18,804 INFO L93 Difference]: Finished difference Result 28233 states and 86098 transitions. [2019-12-18 18:36:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:36:18,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 18:36:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:18,832 INFO L225 Difference]: With dead ends: 28233 [2019-12-18 18:36:18,833 INFO L226 Difference]: Without dead ends: 19334 [2019-12-18 18:36:18,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:36:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19334 states. [2019-12-18 18:36:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19334 to 14053. [2019-12-18 18:36:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14053 states. [2019-12-18 18:36:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14053 states to 14053 states and 42429 transitions. [2019-12-18 18:36:19,097 INFO L78 Accepts]: Start accepts. Automaton has 14053 states and 42429 transitions. Word has length 55 [2019-12-18 18:36:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:19,097 INFO L462 AbstractCegarLoop]: Abstraction has 14053 states and 42429 transitions. [2019-12-18 18:36:19,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:36:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 14053 states and 42429 transitions. [2019-12-18 18:36:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:19,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:19,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:19,114 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1981019510, now seen corresponding path program 4 times [2019-12-18 18:36:19,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:19,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470278893] [2019-12-18 18:36:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:19,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470278893] [2019-12-18 18:36:19,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:19,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:36:19,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314734400] [2019-12-18 18:36:19,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:36:19,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:36:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:36:19,293 INFO L87 Difference]: Start difference. First operand 14053 states and 42429 transitions. Second operand 12 states. [2019-12-18 18:36:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:21,050 INFO L93 Difference]: Finished difference Result 21033 states and 63353 transitions. [2019-12-18 18:36:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:36:21,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 18:36:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:21,080 INFO L225 Difference]: With dead ends: 21033 [2019-12-18 18:36:21,080 INFO L226 Difference]: Without dead ends: 18096 [2019-12-18 18:36:21,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2019-12-18 18:36:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18096 states. [2019-12-18 18:36:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18096 to 14343. [2019-12-18 18:36:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14343 states. [2019-12-18 18:36:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14343 states to 14343 states and 43201 transitions. [2019-12-18 18:36:21,330 INFO L78 Accepts]: Start accepts. Automaton has 14343 states and 43201 transitions. Word has length 55 [2019-12-18 18:36:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:21,330 INFO L462 AbstractCegarLoop]: Abstraction has 14343 states and 43201 transitions. [2019-12-18 18:36:21,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:36:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14343 states and 43201 transitions. [2019-12-18 18:36:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:21,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:21,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:21,348 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1441590926, now seen corresponding path program 5 times [2019-12-18 18:36:21,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:21,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496131436] [2019-12-18 18:36:21,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:21,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496131436] [2019-12-18 18:36:21,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:21,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:36:21,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32319013] [2019-12-18 18:36:21,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:36:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:36:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:36:21,510 INFO L87 Difference]: Start difference. First operand 14343 states and 43201 transitions. Second operand 11 states. [2019-12-18 18:36:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:22,862 INFO L93 Difference]: Finished difference Result 34726 states and 104449 transitions. [2019-12-18 18:36:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 18:36:22,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 18:36:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:22,898 INFO L225 Difference]: With dead ends: 34726 [2019-12-18 18:36:22,898 INFO L226 Difference]: Without dead ends: 23943 [2019-12-18 18:36:22,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 18:36:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23943 states. [2019-12-18 18:36:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23943 to 14236. [2019-12-18 18:36:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14236 states. [2019-12-18 18:36:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14236 states to 14236 states and 42892 transitions. [2019-12-18 18:36:23,173 INFO L78 Accepts]: Start accepts. Automaton has 14236 states and 42892 transitions. Word has length 55 [2019-12-18 18:36:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:23,173 INFO L462 AbstractCegarLoop]: Abstraction has 14236 states and 42892 transitions. [2019-12-18 18:36:23,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:36:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14236 states and 42892 transitions. [2019-12-18 18:36:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:36:23,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:23,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:36:23,189 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:23,189 INFO L82 PathProgramCache]: Analyzing trace with hash 170269166, now seen corresponding path program 6 times [2019-12-18 18:36:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:23,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841379177] [2019-12-18 18:36:23,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:23,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841379177] [2019-12-18 18:36:23,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:23,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:36:23,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792572938] [2019-12-18 18:36:23,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:36:23,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:36:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:23,249 INFO L87 Difference]: Start difference. First operand 14236 states and 42892 transitions. Second operand 3 states. [2019-12-18 18:36:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:23,322 INFO L93 Difference]: Finished difference Result 14234 states and 42887 transitions. [2019-12-18 18:36:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:36:23,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:36:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:23,351 INFO L225 Difference]: With dead ends: 14234 [2019-12-18 18:36:23,351 INFO L226 Difference]: Without dead ends: 14234 [2019-12-18 18:36:23,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:36:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14234 states. [2019-12-18 18:36:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14234 to 11919. [2019-12-18 18:36:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11919 states. [2019-12-18 18:36:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 36509 transitions. [2019-12-18 18:36:23,572 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 36509 transitions. Word has length 55 [2019-12-18 18:36:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:23,573 INFO L462 AbstractCegarLoop]: Abstraction has 11919 states and 36509 transitions. [2019-12-18 18:36:23,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:36:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 36509 transitions. [2019-12-18 18:36:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:36:23,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:23,586 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] [2019-12-18 18:36:23,587 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 1 times [2019-12-18 18:36:23,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:23,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913630113] [2019-12-18 18:36:23,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:36:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:36:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913630113] [2019-12-18 18:36:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:36:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:36:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745827390] [2019-12-18 18:36:24,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:36:24,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:36:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:36:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:36:24,207 INFO L87 Difference]: Start difference. First operand 11919 states and 36509 transitions. Second operand 20 states. [2019-12-18 18:36:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:36:29,417 INFO L93 Difference]: Finished difference Result 20974 states and 63076 transitions. [2019-12-18 18:36:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 18:36:29,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 18:36:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:36:29,446 INFO L225 Difference]: With dead ends: 20974 [2019-12-18 18:36:29,447 INFO L226 Difference]: Without dead ends: 20608 [2019-12-18 18:36:29,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 18:36:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20608 states. [2019-12-18 18:36:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20608 to 11821. [2019-12-18 18:36:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11821 states. [2019-12-18 18:36:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 36275 transitions. [2019-12-18 18:36:29,677 INFO L78 Accepts]: Start accepts. Automaton has 11821 states and 36275 transitions. Word has length 56 [2019-12-18 18:36:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:36:29,677 INFO L462 AbstractCegarLoop]: Abstraction has 11821 states and 36275 transitions. [2019-12-18 18:36:29,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:36:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 11821 states and 36275 transitions. [2019-12-18 18:36:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:36:29,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:36:29,694 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] [2019-12-18 18:36:29,694 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:36:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:36:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 2 times [2019-12-18 18:36:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:36:29,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090929297] [2019-12-18 18:36:29,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:36:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:36:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:36:29,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:36:29,804 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:36:29,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:36:29,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-18 18:36:29,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 18:36:29,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:36:29,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1393363364 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1393363364 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1393363364 |P2Thread1of1ForFork1_#t~ite32_Out-1393363364|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1393363364| ~x~0_In-1393363364)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1393363364, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1393363364, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1393363364, ~x~0=~x~0_In-1393363364} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1393363364|, ~x$w_buff1~0=~x$w_buff1~0_In-1393363364, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1393363364, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1393363364, ~x~0=~x~0_In-1393363364} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:36:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:36:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1696699396 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1696699396 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1696699396 |P2Thread1of1ForFork1_#t~ite34_Out-1696699396|)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1696699396| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1696699396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696699396} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1696699396|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1696699396, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1696699396} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:36:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In778772487 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In778772487 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out778772487| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out778772487| ~x$w_buff0_used~0_In778772487) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In778772487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778772487} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In778772487, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out778772487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778772487} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:36:29,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1308535413 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1308535413 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1308535413 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1308535413 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-1308535413| ~x$w_buff1_used~0_In-1308535413) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1308535413| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1308535413, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1308535413, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1308535413, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1308535413} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1308535413, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1308535413, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1308535413, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1308535413|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1308535413} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:36:29,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In114904568 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In114904568| |P0Thread1of1ForFork2_#t~ite8_Out114904568|) (= ~x$w_buff0~0_In114904568 |P0Thread1of1ForFork2_#t~ite9_Out114904568|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out114904568| |P0Thread1of1ForFork2_#t~ite8_Out114904568|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In114904568 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In114904568 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In114904568 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In114904568 256))))) (= ~x$w_buff0~0_In114904568 |P0Thread1of1ForFork2_#t~ite8_Out114904568|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In114904568, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In114904568, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In114904568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In114904568, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In114904568, ~weak$$choice2~0=~weak$$choice2~0_In114904568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In114904568} OutVars{~x$w_buff0~0=~x$w_buff0~0_In114904568, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In114904568, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out114904568|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In114904568, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out114904568|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In114904568, ~weak$$choice2~0=~weak$$choice2~0_In114904568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In114904568} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 18:36:29,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1988701180 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1988701180 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1988701180 256)) (and (= 0 (mod ~x$w_buff1_used~0_In1988701180 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In1988701180 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite15_Out1988701180| |P0Thread1of1ForFork2_#t~ite14_Out1988701180|) (= ~x$w_buff0_used~0_In1988701180 |P0Thread1of1ForFork2_#t~ite14_Out1988701180|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite14_In1988701180| |P0Thread1of1ForFork2_#t~ite14_Out1988701180|) (= |P0Thread1of1ForFork2_#t~ite15_Out1988701180| ~x$w_buff0_used~0_In1988701180) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1988701180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988701180, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1988701180, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1988701180|, ~weak$$choice2~0=~weak$$choice2~0_In1988701180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988701180} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1988701180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988701180, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1988701180|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1988701180, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1988701180|, ~weak$$choice2~0=~weak$$choice2~0_In1988701180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988701180} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:36:29,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In185435633 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In185435633| |P0Thread1of1ForFork2_#t~ite17_Out185435633|) (= ~x$w_buff1_used~0_In185435633 |P0Thread1of1ForFork2_#t~ite18_Out185435633|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out185435633| |P0Thread1of1ForFork2_#t~ite17_Out185435633|) (= ~x$w_buff1_used~0_In185435633 |P0Thread1of1ForFork2_#t~ite17_Out185435633|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In185435633 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In185435633 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In185435633 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In185435633 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In185435633, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In185435633|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185435633, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In185435633, ~weak$$choice2~0=~weak$$choice2~0_In185435633, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185435633} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In185435633, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out185435633|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out185435633|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In185435633, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In185435633, ~weak$$choice2~0=~weak$$choice2~0_In185435633, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185435633} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:36:29,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:36:29,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1717417336 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1717417336 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1717417336 256) 0) .cse0) (and (= (mod ~x$w_buff1_used~0_In-1717417336 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1717417336 256)))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1717417336| |P0Thread1of1ForFork2_#t~ite23_Out-1717417336|) (= ~x$r_buff1_thd1~0_In-1717417336 |P0Thread1of1ForFork2_#t~ite23_Out-1717417336|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In-1717417336| |P0Thread1of1ForFork2_#t~ite23_Out-1717417336|) (not .cse1) (= ~x$r_buff1_thd1~0_In-1717417336 |P0Thread1of1ForFork2_#t~ite24_Out-1717417336|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717417336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1717417336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1717417336, ~weak$$choice2~0=~weak$$choice2~0_In-1717417336, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1717417336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717417336} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717417336, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1717417336, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1717417336, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1717417336|, ~weak$$choice2~0=~weak$$choice2~0_In-1717417336, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1717417336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717417336} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 18:36:29,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-1723926423 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1723926423 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1723926423 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1723926423 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1723926423| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite35_Out-1723926423| ~x$w_buff1_used~0_In-1723926423) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723926423, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1723926423, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1723926423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1723926423} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1723926423|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723926423, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1723926423, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1723926423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1723926423} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:36:29,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1890587407 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1890587407 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1890587407| ~x$r_buff0_thd3~0_In1890587407)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out1890587407| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1890587407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1890587407} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1890587407|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1890587407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1890587407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:36:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In963820865 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In963820865 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In963820865 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In963820865 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In963820865 |P2Thread1of1ForFork1_#t~ite37_Out963820865|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out963820865| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In963820865, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In963820865, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In963820865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In963820865} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out963820865|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In963820865, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In963820865, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In963820865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In963820865} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:36:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:36:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1095964157 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1095964157 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1095964157) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1095964157 ~x$r_buff0_thd2~0_Out1095964157)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1095964157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095964157} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1095964157|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1095964157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095964157} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:36:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In773019202 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In773019202 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In773019202 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In773019202 256)))) (or (and (= ~x$r_buff1_thd2~0_In773019202 |P1Thread1of1ForFork0_#t~ite31_Out773019202|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out773019202|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In773019202, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In773019202, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In773019202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In773019202} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out773019202|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In773019202, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In773019202, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In773019202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In773019202} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:36:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:36:29,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:36:29,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:36:29,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In374663038 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In374663038 256) 0))) (or (and (= ~x~0_In374663038 |ULTIMATE.start_main_#t~ite41_Out374663038|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out374663038| ~x$w_buff1~0_In374663038) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In374663038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374663038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In374663038, ~x~0=~x~0_In374663038} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out374663038|, ~x$w_buff1~0=~x$w_buff1~0_In374663038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374663038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In374663038, ~x~0=~x~0_In374663038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 18:36:29,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 18:36:29,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In486222183 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In486222183 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out486222183| ~x$w_buff0_used~0_In486222183)) (and (= |ULTIMATE.start_main_#t~ite43_Out486222183| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486222183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486222183} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486222183, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out486222183|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486222183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:36:29,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1372259355 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1372259355 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1372259355 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1372259355 256)))) (or (and (= ~x$w_buff1_used~0_In-1372259355 |ULTIMATE.start_main_#t~ite44_Out-1372259355|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1372259355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1372259355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1372259355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1372259355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1372259355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1372259355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1372259355, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1372259355, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1372259355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1372259355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:36:29,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In486288973 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In486288973 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In486288973 |ULTIMATE.start_main_#t~ite45_Out486288973|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out486288973|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486288973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486288973} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486288973, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out486288973|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486288973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:36:29,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-215324306 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-215324306 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-215324306 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-215324306 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-215324306| ~x$r_buff1_thd0~0_In-215324306) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-215324306| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-215324306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-215324306, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-215324306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215324306} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-215324306, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-215324306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-215324306, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-215324306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215324306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:36:29,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:36:29,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:36:29 BasicIcfg [2019-12-18 18:36:29,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:36:29,937 INFO L168 Benchmark]: Toolchain (without parser) took 125476.36 ms. Allocated memory was 137.4 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 99.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,938 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.79 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.95 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,944 INFO L168 Benchmark]: Boogie Preprocessor took 51.37 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,944 INFO L168 Benchmark]: RCFGBuilder took 780.58 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 102.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,945 INFO L168 Benchmark]: TraceAbstraction took 123806.21 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 18:36:29,953 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.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.79 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.95 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.37 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.58 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 102.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123806.21 ms. Allocated memory was 200.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 45.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4429 SDtfs, 5919 SDslu, 15384 SDs, 0 SdLazy, 13748 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 49 SyntacticMatches, 17 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134187occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 150647 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 139923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...