/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:56:35,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:56:35,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:56:35,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:56:35,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:56:35,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:56:35,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:56:35,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:56:35,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:56:35,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:56:35,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:56:35,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:56:35,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:56:35,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:56:35,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:56:35,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:56:35,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:56:35,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:56:35,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:56:35,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:56:35,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:56:35,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:56:35,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:56:35,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:56:35,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:56:35,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:56:35,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:56:35,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:56:35,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:56:35,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:56:35,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:56:35,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:56:35,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:56:35,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:56:35,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:56:35,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:56:35,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:56:35,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:56:35,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:56:35,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:56:35,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:56:35,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:56:35,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:56:35,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:56:35,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:56:35,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:56:35,395 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:56:35,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:56:35,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:56:35,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:56:35,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:56:35,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:56:35,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:56:35,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:56:35,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:56:35,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:56:35,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:56:35,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:56:35,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:56:35,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:56:35,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:56:35,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:56:35,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:56:35,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:56:35,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:56:35,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:56:35,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:56:35,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:56:35,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:56:35,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:56:35,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:56:35,683 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:56:35,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-18 12:56:35,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dec6d34/e54213a7ab734a51945d6dd23d45f582/FLAG34b02c68f [2019-12-18 12:56:36,326 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:56:36,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-18 12:56:36,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dec6d34/e54213a7ab734a51945d6dd23d45f582/FLAG34b02c68f [2019-12-18 12:56:36,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dec6d34/e54213a7ab734a51945d6dd23d45f582 [2019-12-18 12:56:36,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:56:36,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:56:36,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:36,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:56:36,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:56:36,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:36" (1/1) ... [2019-12-18 12:56:36,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:36, skipping insertion in model container [2019-12-18 12:56:36,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:36" (1/1) ... [2019-12-18 12:56:36,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:56:36,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:56:37,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:37,272 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:56:37,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:37,429 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:56:37,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37 WrapperNode [2019-12-18 12:56:37,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:37,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:37,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:56:37,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:56:37,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:37,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:56:37,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:56:37,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:56:37,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... [2019-12-18 12:56:37,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:56:37,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:56:37,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:56:37,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:56:37,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:56:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:56:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:56:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:56:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:56:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:56:37,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:56:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:56:37,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:56:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:56:37,621 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:56:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:56:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:56:37,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:56:37,623 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:56:38,343 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:56:38,344 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:56:38,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:38 BoogieIcfgContainer [2019-12-18 12:56:38,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:56:38,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:56:38,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:56:38,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:56:38,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:56:36" (1/3) ... [2019-12-18 12:56:38,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b8d928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:38, skipping insertion in model container [2019-12-18 12:56:38,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:37" (2/3) ... [2019-12-18 12:56:38,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b8d928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:38, skipping insertion in model container [2019-12-18 12:56:38,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:38" (3/3) ... [2019-12-18 12:56:38,357 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2019-12-18 12:56:38,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:56:38,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:56:38,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:56:38,374 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:56:38,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,480 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,480 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,480 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:38,520 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:56:38,537 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:56:38,537 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:56:38,537 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:56:38,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:56:38,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:56:38,538 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:56:38,538 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:56:38,538 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:56:38,556 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 12:56:38,558 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 12:56:38,646 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 12:56:38,646 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:38,665 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 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:56:38,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 12:56:38,752 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 12:56:38,753 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:38,766 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 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:56:38,789 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 12:56:38,790 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:56:44,524 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:56:44,646 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:56:44,664 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-18 12:56:44,664 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 12:56:44,668 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 12:56:55,576 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-18 12:56:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-18 12:56:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:56:55,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:55,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:56:55,585 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 12:56:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-18 12:56:55,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:55,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606694272] [2019-12-18 12:56:55,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:55,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606694272] [2019-12-18 12:56:55,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:55,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:56:55,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072774134] [2019-12-18 12:56:55,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:55,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:55,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:55,848 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-18 12:56:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:57,613 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-18 12:56:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:57,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:56:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:00,564 INFO L225 Difference]: With dead ends: 82042 [2019-12-18 12:57:00,565 INFO L226 Difference]: Without dead ends: 77338 [2019-12-18 12:57:00,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 12:57:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-18 12:57:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-18 12:57:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-18 12:57:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-18 12:57:06,270 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-18 12:57:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:06,270 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-18 12:57:06,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-18 12:57:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:57:06,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:06,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:06,280 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 12:57:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-18 12:57:06,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:06,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607544743] [2019-12-18 12:57:06,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:06,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607544743] [2019-12-18 12:57:06,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:06,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:06,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034387547] [2019-12-18 12:57:06,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:06,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:06,435 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-18 12:57:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:11,069 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-18 12:57:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:11,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:57:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:11,641 INFO L225 Difference]: With dead ends: 119002 [2019-12-18 12:57:11,641 INFO L226 Difference]: Without dead ends: 118911 [2019-12-18 12:57:11,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-18 12:57:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-18 12:57:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-18 12:57:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-18 12:57:19,112 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-18 12:57:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:19,113 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-18 12:57:19,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-18 12:57:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:57:19,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:19,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:19,118 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 12:57:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-18 12:57:19,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:19,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388965206] [2019-12-18 12:57:19,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:19,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388965206] [2019-12-18 12:57:19,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:19,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:19,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624867545] [2019-12-18 12:57:19,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:19,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:19,197 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-18 12:57:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:20,149 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-18 12:57:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:20,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:57:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:20,603 INFO L225 Difference]: With dead ends: 153490 [2019-12-18 12:57:20,603 INFO L226 Difference]: Without dead ends: 153386 [2019-12-18 12:57:20,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-18 12:57:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-18 12:57:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-18 12:57:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-18 12:57:32,112 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-18 12:57:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:32,112 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-18 12:57:32,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-18 12:57:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:57:32,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:32,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:32,117 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 12:57:32,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:32,117 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-18 12:57:32,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:32,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368470726] [2019-12-18 12:57:32,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:32,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368470726] [2019-12-18 12:57:32,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:32,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:32,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153375072] [2019-12-18 12:57:32,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:32,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:32,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:32,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:32,246 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 4 states. [2019-12-18 12:57:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:37,932 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-18 12:57:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:37,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:57:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:38,415 INFO L225 Difference]: With dead ends: 162838 [2019-12-18 12:57:38,415 INFO L226 Difference]: Without dead ends: 162750 [2019-12-18 12:57:38,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-18 12:57:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-18 12:57:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-18 12:57:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-18 12:57:48,479 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-18 12:57:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:48,479 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-18 12:57:48,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-18 12:57:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:57:48,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:48,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:48,484 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 12:57:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-18 12:57:48,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:48,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130050026] [2019-12-18 12:57:48,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:57:49,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130050026] [2019-12-18 12:57:49,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:49,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:49,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789962513] [2019-12-18 12:57:49,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:49,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:49,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:49,478 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 3 states. [2019-12-18 12:57:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:50,475 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-18 12:57:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:50,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 12:57:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:51,035 INFO L225 Difference]: With dead ends: 195371 [2019-12-18 12:57:51,036 INFO L226 Difference]: Without dead ends: 195371 [2019-12-18 12:57:51,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-18 12:58:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-18 12:58:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-18 12:58:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-18 12:58:05,827 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-18 12:58:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:05,827 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-18 12:58:05,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-18 12:58:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:58:05,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:05,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:05,830 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 12:58:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-18 12:58:05,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:05,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256548474] [2019-12-18 12:58:05,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256548474] [2019-12-18 12:58:05,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:05,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:05,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025538825] [2019-12-18 12:58:05,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:05,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:05,903 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 4 states. [2019-12-18 12:58:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:12,659 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-18 12:58:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:12,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:58:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:13,261 INFO L225 Difference]: With dead ends: 200032 [2019-12-18 12:58:13,261 INFO L226 Difference]: Without dead ends: 199944 [2019-12-18 12:58:13,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-18 12:58:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-18 12:58:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-18 12:58:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-18 12:58:25,483 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-18 12:58:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:25,483 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-18 12:58:25,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-18 12:58:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:58:25,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:25,504 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 12:58:25,505 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 12:58:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-18 12:58:25,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:25,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051173668] [2019-12-18 12:58:25,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:25,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051173668] [2019-12-18 12:58:25,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:25,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:58:25,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814076115] [2019-12-18 12:58:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:25,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:25,586 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-18 12:58:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:27,779 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-18 12:58:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:27,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:58:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:28,290 INFO L225 Difference]: With dead ends: 173738 [2019-12-18 12:58:28,291 INFO L226 Difference]: Without dead ends: 173738 [2019-12-18 12:58:28,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-18 12:58:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-18 12:58:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-18 12:58:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-18 12:58:43,387 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-18 12:58:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:43,388 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-18 12:58:43,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-18 12:58:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:58:43,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:43,410 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 12:58:43,410 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 12:58:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-18 12:58:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:43,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825810409] [2019-12-18 12:58:43,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:43,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825810409] [2019-12-18 12:58:43,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:43,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446106094] [2019-12-18 12:58:43,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:43,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:43,452 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 3 states. [2019-12-18 12:58:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:51,452 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-18 12:58:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:51,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:58:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:51,933 INFO L225 Difference]: With dead ends: 286764 [2019-12-18 12:58:51,933 INFO L226 Difference]: Without dead ends: 162140 [2019-12-18 12:58:51,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-18 12:58:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-18 12:58:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-18 12:58:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-18 12:58:59,170 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-18 12:58:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:59,171 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-18 12:58:59,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-18 12:58:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:58:59,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:59,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] [2019-12-18 12:58:59,189 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 12:58:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-18 12:58:59,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:59,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165961999] [2019-12-18 12:58:59,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:59,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165961999] [2019-12-18 12:58:59,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:59,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:59,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544963734] [2019-12-18 12:58:59,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:59,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:59,245 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-18 12:59:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:01,060 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-18 12:59:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:01,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:59:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:01,428 INFO L225 Difference]: With dead ends: 145211 [2019-12-18 12:59:01,428 INFO L226 Difference]: Without dead ends: 145211 [2019-12-18 12:59:01,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-18 12:59:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-18 12:59:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-18 12:59:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-18 12:59:13,390 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-18 12:59:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:13,391 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-18 12:59:13,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-18 12:59:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:59:13,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:13,405 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 12:59:13,405 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 12:59:13,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:13,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-18 12:59:13,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:13,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781915332] [2019-12-18 12:59:13,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:13,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781915332] [2019-12-18 12:59:13,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:13,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:13,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438189899] [2019-12-18 12:59:13,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:59:13,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:59:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:59:13,474 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 4 states. [2019-12-18 12:59:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:13,664 INFO L93 Difference]: Finished difference Result 37001 states and 128263 transitions. [2019-12-18 12:59:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:59:13,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 12:59:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:13,715 INFO L225 Difference]: With dead ends: 37001 [2019-12-18 12:59:13,715 INFO L226 Difference]: Without dead ends: 29146 [2019-12-18 12:59:13,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29146 states. [2019-12-18 12:59:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29146 to 29146. [2019-12-18 12:59:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29146 states. [2019-12-18 12:59:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29146 states to 29146 states and 96447 transitions. [2019-12-18 12:59:15,183 INFO L78 Accepts]: Start accepts. Automaton has 29146 states and 96447 transitions. Word has length 19 [2019-12-18 12:59:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:15,183 INFO L462 AbstractCegarLoop]: Abstraction has 29146 states and 96447 transitions. [2019-12-18 12:59:15,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:59:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 29146 states and 96447 transitions. [2019-12-18 12:59:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:59:15,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:15,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:15,190 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 12:59:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-18 12:59:15,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:15,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744662037] [2019-12-18 12:59:15,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:15,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744662037] [2019-12-18 12:59:15,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:15,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:15,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744425908] [2019-12-18 12:59:15,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:15,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:15,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:15,260 INFO L87 Difference]: Start difference. First operand 29146 states and 96447 transitions. Second operand 5 states. [2019-12-18 12:59:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:15,767 INFO L93 Difference]: Finished difference Result 38772 states and 125581 transitions. [2019-12-18 12:59:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:59:15,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:59:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:15,828 INFO L225 Difference]: With dead ends: 38772 [2019-12-18 12:59:15,828 INFO L226 Difference]: Without dead ends: 38582 [2019-12-18 12:59:15,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:59:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38582 states. [2019-12-18 12:59:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38582 to 30300. [2019-12-18 12:59:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30300 states. [2019-12-18 12:59:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30300 states to 30300 states and 99903 transitions. [2019-12-18 12:59:16,415 INFO L78 Accepts]: Start accepts. Automaton has 30300 states and 99903 transitions. Word has length 22 [2019-12-18 12:59:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:16,415 INFO L462 AbstractCegarLoop]: Abstraction has 30300 states and 99903 transitions. [2019-12-18 12:59:16,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 30300 states and 99903 transitions. [2019-12-18 12:59:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:59:16,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:16,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:16,422 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 12:59:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-18 12:59:16,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:16,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20103624] [2019-12-18 12:59:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:16,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20103624] [2019-12-18 12:59:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:16,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:16,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273083256] [2019-12-18 12:59:16,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:16,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:16,483 INFO L87 Difference]: Start difference. First operand 30300 states and 99903 transitions. Second operand 5 states. [2019-12-18 12:59:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:16,973 INFO L93 Difference]: Finished difference Result 39158 states and 126704 transitions. [2019-12-18 12:59:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:59:16,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:59:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:19,013 INFO L225 Difference]: With dead ends: 39158 [2019-12-18 12:59:19,013 INFO L226 Difference]: Without dead ends: 38890 [2019-12-18 12:59:19,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:59:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38890 states. [2019-12-18 12:59:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38890 to 28976. [2019-12-18 12:59:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28976 states. [2019-12-18 12:59:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28976 states to 28976 states and 95692 transitions. [2019-12-18 12:59:19,560 INFO L78 Accepts]: Start accepts. Automaton has 28976 states and 95692 transitions. Word has length 22 [2019-12-18 12:59:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:19,560 INFO L462 AbstractCegarLoop]: Abstraction has 28976 states and 95692 transitions. [2019-12-18 12:59:19,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28976 states and 95692 transitions. [2019-12-18 12:59:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:59:19,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:19,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:19,571 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 12:59:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 732122685, now seen corresponding path program 1 times [2019-12-18 12:59:19,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:19,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587303626] [2019-12-18 12:59:19,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:19,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587303626] [2019-12-18 12:59:19,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:19,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:19,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564967611] [2019-12-18 12:59:19,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:19,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:19,694 INFO L87 Difference]: Start difference. First operand 28976 states and 95692 transitions. Second operand 5 states. [2019-12-18 12:59:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:20,134 INFO L93 Difference]: Finished difference Result 30624 states and 99701 transitions. [2019-12-18 12:59:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:59:20,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 12:59:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:20,185 INFO L225 Difference]: With dead ends: 30624 [2019-12-18 12:59:20,185 INFO L226 Difference]: Without dead ends: 30597 [2019-12-18 12:59:20,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:59:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30597 states. [2019-12-18 12:59:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30597 to 29549. [2019-12-18 12:59:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-18 12:59:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-18 12:59:21,043 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 25 [2019-12-18 12:59:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:21,043 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-18 12:59:21,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-18 12:59:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:59:21,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:21,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:21,058 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 12:59:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-18 12:59:21,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:21,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2692189] [2019-12-18 12:59:21,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:21,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2692189] [2019-12-18 12:59:21,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:21,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:21,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576457397] [2019-12-18 12:59:21,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:21,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:21,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:21,131 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 5 states. [2019-12-18 12:59:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:21,512 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-18 12:59:21,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:59:21,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:59:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:21,576 INFO L225 Difference]: With dead ends: 40243 [2019-12-18 12:59:21,576 INFO L226 Difference]: Without dead ends: 40219 [2019-12-18 12:59:21,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:59:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-18 12:59:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-18 12:59:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-18 12:59:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-18 12:59:22,209 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-18 12:59:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:22,209 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-18 12:59:22,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-18 12:59:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:59:22,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:22,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:22,228 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 12:59:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-18 12:59:22,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:22,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095935069] [2019-12-18 12:59:22,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:22,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 12:59:22,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095935069] [2019-12-18 12:59:22,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:22,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:22,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368776133] [2019-12-18 12:59:22,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:22,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:22,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:22,289 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 5 states. [2019-12-18 12:59:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:22,776 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-18 12:59:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:59:22,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:59:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:22,875 INFO L225 Difference]: With dead ends: 41985 [2019-12-18 12:59:22,875 INFO L226 Difference]: Without dead ends: 41961 [2019-12-18 12:59:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:59:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-18 12:59:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-18 12:59:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-18 12:59:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-18 12:59:23,738 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-18 12:59:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:23,739 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-18 12:59:23,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-18 12:59:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:59:23,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:23,757 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] [2019-12-18 12:59:23,757 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 12:59:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-18 12:59:23,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:23,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985209245] [2019-12-18 12:59:23,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:23,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985209245] [2019-12-18 12:59:23,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:23,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:59:23,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658624482] [2019-12-18 12:59:23,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:23,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:23,835 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 5 states. [2019-12-18 12:59:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:23,934 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-18 12:59:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:59:23,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:59:23,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:23,956 INFO L225 Difference]: With dead ends: 13714 [2019-12-18 12:59:23,956 INFO L226 Difference]: Without dead ends: 11900 [2019-12-18 12:59:23,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:59:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-18 12:59:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-18 12:59:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-18 12:59:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-18 12:59:24,130 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-18 12:59:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:24,130 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-18 12:59:24,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-18 12:59:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:59:24,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:24,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:24,141 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 12:59:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-18 12:59:24,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:24,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121751171] [2019-12-18 12:59:24,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:24,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121751171] [2019-12-18 12:59:24,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:24,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:59:24,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284737910] [2019-12-18 12:59:24,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:59:24,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:59:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:59:24,232 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-18 12:59:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:24,770 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-18 12:59:24,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:59:24,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:59:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:24,801 INFO L225 Difference]: With dead ends: 14689 [2019-12-18 12:59:24,801 INFO L226 Difference]: Without dead ends: 14687 [2019-12-18 12:59:24,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:59:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-18 12:59:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-18 12:59:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-18 12:59:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-18 12:59:25,110 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-18 12:59:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:25,110 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-18 12:59:25,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:59:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-18 12:59:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:59:25,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:25,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:25,124 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 12:59:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-18 12:59:25,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:25,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824663750] [2019-12-18 12:59:25,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:25,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824663750] [2019-12-18 12:59:25,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:25,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:59:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171543546] [2019-12-18 12:59:25,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:59:25,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:59:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:25,195 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 5 states. [2019-12-18 12:59:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:25,660 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-18 12:59:25,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:59:25,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:59:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:25,686 INFO L225 Difference]: With dead ends: 18223 [2019-12-18 12:59:25,687 INFO L226 Difference]: Without dead ends: 18223 [2019-12-18 12:59:25,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:59:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-18 12:59:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-18 12:59:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-18 12:59:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-18 12:59:26,017 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-18 12:59:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:26,018 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-18 12:59:26,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:59:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-18 12:59:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:59:26,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:26,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:26,041 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 12:59:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-18 12:59:26,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:26,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063758211] [2019-12-18 12:59:26,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:26,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063758211] [2019-12-18 12:59:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:26,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:59:26,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549782131] [2019-12-18 12:59:26,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:59:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:59:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:26,103 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 3 states. [2019-12-18 12:59:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:26,180 INFO L93 Difference]: Finished difference Result 15143 states and 45952 transitions. [2019-12-18 12:59:26,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:26,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:59:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:26,207 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 12:59:26,207 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 12:59:26,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 12:59:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14516. [2019-12-18 12:59:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-18 12:59:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-18 12:59:26,416 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-18 12:59:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:26,417 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-18 12:59:26,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-18 12:59:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:59:26,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:26,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:26,434 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 12:59:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-18 12:59:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:26,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168104831] [2019-12-18 12:59:26,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:26,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168104831] [2019-12-18 12:59:26,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:26,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:59:26,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938080755] [2019-12-18 12:59:26,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:59:26,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:59:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:59:26,497 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 6 states. [2019-12-18 12:59:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:27,006 INFO L93 Difference]: Finished difference Result 17222 states and 51134 transitions. [2019-12-18 12:59:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:59:27,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:59:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:27,029 INFO L225 Difference]: With dead ends: 17222 [2019-12-18 12:59:27,029 INFO L226 Difference]: Without dead ends: 17220 [2019-12-18 12:59:27,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:59:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2019-12-18 12:59:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 13885. [2019-12-18 12:59:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2019-12-18 12:59:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 42429 transitions. [2019-12-18 12:59:27,250 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 42429 transitions. Word has length 41 [2019-12-18 12:59:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:27,250 INFO L462 AbstractCegarLoop]: Abstraction has 13885 states and 42429 transitions. [2019-12-18 12:59:27,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:59:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 42429 transitions. [2019-12-18 12:59:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:59:27,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:27,265 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 12:59:27,265 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 12:59:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash 771947399, now seen corresponding path program 1 times [2019-12-18 12:59:27,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:27,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514140615] [2019-12-18 12:59:27,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:27,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514140615] [2019-12-18 12:59:27,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:27,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:59:27,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831514731] [2019-12-18 12:59:27,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:59:27,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:59:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:59:27,351 INFO L87 Difference]: Start difference. First operand 13885 states and 42429 transitions. Second operand 6 states. [2019-12-18 12:59:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:27,479 INFO L93 Difference]: Finished difference Result 12733 states and 39642 transitions. [2019-12-18 12:59:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:59:27,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:59:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:27,502 INFO L225 Difference]: With dead ends: 12733 [2019-12-18 12:59:27,503 INFO L226 Difference]: Without dead ends: 11550 [2019-12-18 12:59:27,503 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 12:59:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-12-18 12:59:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11130. [2019-12-18 12:59:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-18 12:59:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-18 12:59:27,755 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-18 12:59:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:27,755 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-18 12:59:27,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:59:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-18 12:59:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:27,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:27,772 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 12:59:27,772 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 12:59:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-18 12:59:27,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:27,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113890638] [2019-12-18 12:59:27,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:27,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113890638] [2019-12-18 12:59:27,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:27,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:27,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029834773] [2019-12-18 12:59:27,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:59:27,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:59:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:27,818 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 3 states. [2019-12-18 12:59:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:27,899 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-18 12:59:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:27,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 12:59:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:27,920 INFO L225 Difference]: With dead ends: 12575 [2019-12-18 12:59:27,921 INFO L226 Difference]: Without dead ends: 12575 [2019-12-18 12:59:27,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-18 12:59:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-18 12:59:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-18 12:59:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-18 12:59:28,162 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-18 12:59:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:28,163 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-18 12:59:28,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-18 12:59:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:28,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:28,173 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 12:59:28,173 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 12:59:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-18 12:59:28,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:28,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180734975] [2019-12-18 12:59:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:28,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180734975] [2019-12-18 12:59:28,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:59:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569066748] [2019-12-18 12:59:28,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:59:28,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:59:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:59:28,235 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 4 states. [2019-12-18 12:59:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:28,313 INFO L93 Difference]: Finished difference Result 16499 states and 51208 transitions. [2019-12-18 12:59:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:59:28,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 12:59:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:28,327 INFO L225 Difference]: With dead ends: 16499 [2019-12-18 12:59:28,327 INFO L226 Difference]: Without dead ends: 6904 [2019-12-18 12:59:28,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:59:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-18 12:59:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2019-12-18 12:59:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-18 12:59:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-18 12:59:28,471 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-18 12:59:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:28,472 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-18 12:59:28,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:59:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-18 12:59:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:28,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:28,479 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 12:59:28,479 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 12:59:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-18 12:59:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741695349] [2019-12-18 12:59:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:28,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741695349] [2019-12-18 12:59:28,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:28,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:59:28,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007187458] [2019-12-18 12:59:28,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:59:28,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:59:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:59:28,979 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 14 states. [2019-12-18 12:59:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:32,940 INFO L93 Difference]: Finished difference Result 15924 states and 49392 transitions. [2019-12-18 12:59:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 12:59:32,941 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 12:59:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:32,963 INFO L225 Difference]: With dead ends: 15924 [2019-12-18 12:59:32,963 INFO L226 Difference]: Without dead ends: 14966 [2019-12-18 12:59:32,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 12:59:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14966 states. [2019-12-18 12:59:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14966 to 11300. [2019-12-18 12:59:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11300 states. [2019-12-18 12:59:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11300 states to 11300 states and 34749 transitions. [2019-12-18 12:59:33,171 INFO L78 Accepts]: Start accepts. Automaton has 11300 states and 34749 transitions. Word has length 56 [2019-12-18 12:59:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:33,172 INFO L462 AbstractCegarLoop]: Abstraction has 11300 states and 34749 transitions. [2019-12-18 12:59:33,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:59:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11300 states and 34749 transitions. [2019-12-18 12:59:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:33,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:33,184 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 12:59:33,184 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2017615148, now seen corresponding path program 3 times [2019-12-18 12:59:33,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:33,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740673983] [2019-12-18 12:59:33,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:33,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740673983] [2019-12-18 12:59:33,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:33,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:59:33,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473310439] [2019-12-18 12:59:33,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:59:33,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:33,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:59:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:59:33,735 INFO L87 Difference]: Start difference. First operand 11300 states and 34749 transitions. Second operand 14 states. [2019-12-18 12:59:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:36,937 INFO L93 Difference]: Finished difference Result 15457 states and 47124 transitions. [2019-12-18 12:59:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 12:59:36,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 12:59:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:36,952 INFO L225 Difference]: With dead ends: 15457 [2019-12-18 12:59:36,952 INFO L226 Difference]: Without dead ends: 9221 [2019-12-18 12:59:36,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 12:59:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-18 12:59:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 7959. [2019-12-18 12:59:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7959 states. [2019-12-18 12:59:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 24081 transitions. [2019-12-18 12:59:37,081 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 24081 transitions. Word has length 56 [2019-12-18 12:59:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:37,082 INFO L462 AbstractCegarLoop]: Abstraction has 7959 states and 24081 transitions. [2019-12-18 12:59:37,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:59:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 24081 transitions. [2019-12-18 12:59:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:37,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:37,093 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 12:59:37,093 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:37,094 INFO L82 PathProgramCache]: Analyzing trace with hash 637748608, now seen corresponding path program 4 times [2019-12-18 12:59:37,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:37,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916985357] [2019-12-18 12:59:37,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916985357] [2019-12-18 12:59:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:59:37,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636071827] [2019-12-18 12:59:37,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:59:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:59:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:59:37,573 INFO L87 Difference]: Start difference. First operand 7959 states and 24081 transitions. Second operand 15 states. [2019-12-18 12:59:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:40,434 INFO L93 Difference]: Finished difference Result 9635 states and 28429 transitions. [2019-12-18 12:59:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 12:59:40,435 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 12:59:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:40,447 INFO L225 Difference]: With dead ends: 9635 [2019-12-18 12:59:40,447 INFO L226 Difference]: Without dead ends: 8815 [2019-12-18 12:59:40,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 12:59:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8815 states. [2019-12-18 12:59:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8815 to 7771. [2019-12-18 12:59:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7771 states. [2019-12-18 12:59:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7771 states to 7771 states and 23538 transitions. [2019-12-18 12:59:40,571 INFO L78 Accepts]: Start accepts. Automaton has 7771 states and 23538 transitions. Word has length 56 [2019-12-18 12:59:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:40,571 INFO L462 AbstractCegarLoop]: Abstraction has 7771 states and 23538 transitions. [2019-12-18 12:59:40,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:59:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7771 states and 23538 transitions. [2019-12-18 12:59:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 12:59:40,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:40,579 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 12:59:40,579 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1474997086, now seen corresponding path program 5 times [2019-12-18 12:59:40,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:40,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371879958] [2019-12-18 12:59:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:59:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:59:40,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:59:40,679 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:59:40,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t672~0.base_35|) 0) (= 0 v_~weak$$choice0~0_31) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_191) (= v_~main$tmp_guard1~0_50 0) (= v_~x$flush_delayed~0_46 0) (= v_~weak$$choice2~0_179 0) (= v_~x$r_buff0_thd1~0_355 0) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff0~0_341) (= |v_ULTIMATE.start_main_~#t672~0.offset_25| 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~main$tmp_guard0~0_45 0) (= 0 v_~x$r_buff1_thd3~0_194) (= v_~y~0_194 0) (= 0 v_~x$r_buff0_thd2~0_248) (= 0 v_~__unbuffered_cnt~0_63) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t672~0.base_35|) (= 0 v_~x~0_215) (= v_~x$r_buff1_thd0~0_218 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t672~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t672~0.base_35|) |v_ULTIMATE.start_main_~#t672~0.offset_25| 0)) |v_#memory_int_15|) (= 0 v_~x$w_buff0_used~0_867) (= v_~__unbuffered_p2_EBX~0_66 0) (= v_~z~0_56 0) (= 0 v_~__unbuffered_p2_EAX~0_66) (= v_~x$r_buff0_thd0~0_151 0) (= v_~x$mem_tmp~0_33 0) (= v_~x$r_buff1_thd1~0_359 0) (= 0 v_~x$w_buff1~0_257) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd3~0_139) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t672~0.base_35| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t672~0.base_35| 4)) (= 0 v_~x$w_buff1_used~0_545))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_359, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_139, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_66, ULTIMATE.start_main_~#t674~0.base=|v_ULTIMATE.start_main_~#t674~0.base_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_66, ~x$w_buff1~0=v_~x$w_buff1~0_257, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_545, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_191, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_31, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_215, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_355, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_104|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~x$mem_tmp~0=v_~x$mem_tmp~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_49|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ULTIMATE.start_main_~#t674~0.offset=|v_ULTIMATE.start_main_~#t674~0.offset_25|, ~y~0=v_~y~0_194, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_45, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_248, ULTIMATE.start_main_~#t672~0.base=|v_ULTIMATE.start_main_~#t672~0.base_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_~#t673~0.offset=|v_ULTIMATE.start_main_~#t673~0.offset_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ULTIMATE.start_main_~#t673~0.base=|v_ULTIMATE.start_main_~#t673~0.base_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_48|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_11|, ~z~0=v_~z~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_179, ULTIMATE.start_main_~#t672~0.offset=|v_ULTIMATE.start_main_~#t672~0.offset_25|, ~x$read_delayed~0=v_~x$read_delayed~0_8} 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, ULTIMATE.start_main_~#t674~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, 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, ULTIMATE.start_main_~#t674~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t672~0.base, #NULL.base, ULTIMATE.start_main_~#t673~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t673~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t672~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 12:59:40,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L821-1-->L823: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t673~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t673~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t673~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t673~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t673~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t673~0.base_13|) |v_ULTIMATE.start_main_~#t673~0.offset_11| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t673~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t673~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t673~0.base=|v_ULTIMATE.start_main_~#t673~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t673~0.offset=|v_ULTIMATE.start_main_~#t673~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t673~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t673~0.offset] because there is no mapped edge [2019-12-18 12:59:40,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L823-1-->L825: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t674~0.base_12|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t674~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t674~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t674~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t674~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t674~0.base_12|) |v_ULTIMATE.start_main_~#t674~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t674~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t674~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t674~0.offset=|v_ULTIMATE.start_main_~#t674~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t674~0.base=|v_ULTIMATE.start_main_~#t674~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t674~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t674~0.base] because there is no mapped edge [2019-12-18 12:59:40,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_107) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_108) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_25) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= 1 v_~x$w_buff0~0_34) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_13, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} 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 12:59:40,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L798-2-->L798-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1410076568 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1410076568 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1410076568 |P2Thread1of1ForFork1_#t~ite32_Out1410076568|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1410076568| ~x$w_buff1~0_In1410076568) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1410076568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1410076568, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1410076568, ~x~0=~x~0_In1410076568} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1410076568|, ~x$w_buff1~0=~x$w_buff1~0_In1410076568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1410076568, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1410076568, ~x~0=~x~0_In1410076568} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 12:59:40,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L798-4-->L799: Formula: (= v_~x~0_55 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 12:59:40,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1602431681 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1602431681 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1602431681| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1602431681 |P2Thread1of1ForFork1_#t~ite34_Out1602431681|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1602431681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602431681} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1602431681|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1602431681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602431681} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:59:40,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In539658985 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In539658985 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out539658985|) (not .cse1)) (and (= ~x$w_buff0_used~0_In539658985 |P1Thread1of1ForFork0_#t~ite28_Out539658985|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In539658985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539658985} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In539658985, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out539658985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539658985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 12:59:40,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-332244522 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-332244522 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-332244522 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-332244522 256) 0))) (or (and (= ~x$w_buff1_used~0_In-332244522 |P1Thread1of1ForFork0_#t~ite29_Out-332244522|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-332244522|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-332244522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-332244522, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-332244522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-332244522} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-332244522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-332244522, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-332244522, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-332244522|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-332244522} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:59:40,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In48480105 256)))) (or (and (= ~x$w_buff0~0_In48480105 |P0Thread1of1ForFork2_#t~ite9_Out48480105|) (= |P0Thread1of1ForFork2_#t~ite8_In48480105| |P0Thread1of1ForFork2_#t~ite8_Out48480105|) (not .cse0)) (and (= ~x$w_buff0~0_In48480105 |P0Thread1of1ForFork2_#t~ite8_Out48480105|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In48480105 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In48480105 256))) (= 0 (mod ~x$w_buff0_used~0_In48480105 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In48480105 256))))) (= |P0Thread1of1ForFork2_#t~ite9_Out48480105| |P0Thread1of1ForFork2_#t~ite8_Out48480105|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In48480105, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In48480105, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In48480105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In48480105, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In48480105, ~weak$$choice2~0=~weak$$choice2~0_In48480105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} OutVars{~x$w_buff0~0=~x$w_buff0~0_In48480105, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In48480105, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out48480105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In48480105, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out48480105|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In48480105, ~weak$$choice2~0=~weak$$choice2~0_In48480105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:59:40,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1196357835 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1196357835 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1196357835)) (and (= ~x$r_buff0_thd2~0_In1196357835 ~x$r_buff0_thd2~0_Out1196357835) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1196357835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196357835} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1196357835|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1196357835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196357835} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 12:59:40,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2053231750 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2053231750 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-2053231750 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2053231750 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-2053231750|)) (and (= ~x$r_buff1_thd2~0_In-2053231750 |P1Thread1of1ForFork0_#t~ite31_Out-2053231750|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2053231750, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2053231750, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2053231750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2053231750} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2053231750|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2053231750, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2053231750, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2053231750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2053231750} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:59:40,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_34 (+ v_~__unbuffered_cnt~0_35 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork0_#t~ite31_26|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_25|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, 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 12:59:40,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2087395963 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out-2087395963| |P0Thread1of1ForFork2_#t~ite17_Out-2087395963|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2087395963 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-2087395963 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-2087395963 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-2087395963 256) 0)))) (= ~x$w_buff1_used~0_In-2087395963 |P0Thread1of1ForFork2_#t~ite17_Out-2087395963|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-2087395963| |P0Thread1of1ForFork2_#t~ite17_Out-2087395963|) (= ~x$w_buff1_used~0_In-2087395963 |P0Thread1of1ForFork2_#t~ite18_Out-2087395963|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2087395963, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2087395963|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2087395963, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2087395963, ~weak$$choice2~0=~weak$$choice2~0_In-2087395963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2087395963} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2087395963, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2087395963|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2087395963|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2087395963, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2087395963, ~weak$$choice2~0=~weak$$choice2~0_In-2087395963, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2087395963} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 12:59:40,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L744-->L745: Formula: (and (not (= (mod v_~weak$$choice2~0_45 256) 0)) (= v_~x$r_buff0_thd1~0_116 v_~x$r_buff0_thd1~0_115)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_45} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_45, 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 12:59:40,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2009354628 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2009354628 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In2009354628 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2009354628 256))) (and (= 0 (mod ~x$w_buff1_used~0_In2009354628 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite24_Out2009354628| |P0Thread1of1ForFork2_#t~ite23_Out2009354628|) (= ~x$r_buff1_thd1~0_In2009354628 |P0Thread1of1ForFork2_#t~ite23_Out2009354628|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In2009354628| |P0Thread1of1ForFork2_#t~ite23_Out2009354628|) (= |P0Thread1of1ForFork2_#t~ite24_Out2009354628| ~x$r_buff1_thd1~0_In2009354628)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2009354628, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2009354628, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2009354628, ~weak$$choice2~0=~weak$$choice2~0_In2009354628, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In2009354628|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2009354628} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2009354628, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2009354628, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2009354628, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out2009354628|, ~weak$$choice2~0=~weak$$choice2~0_In2009354628, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out2009354628|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2009354628} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 12:59:40,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~x$mem_tmp~0_7 v_~x~0_28) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (not (= 0 (mod v_~x$flush_delayed~0_10 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 12:59:40,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1887416389 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1887416389 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1887416389 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1887416389 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out1887416389| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out1887416389| ~x$w_buff1_used~0_In1887416389) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1887416389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1887416389, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1887416389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1887416389} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1887416389|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1887416389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1887416389, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1887416389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1887416389} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:59:40,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1816202758 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1816202758 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1816202758| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1816202758| ~x$r_buff0_thd3~0_In-1816202758)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816202758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816202758} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1816202758|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816202758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816202758} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:59:40,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In853140234 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In853140234 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In853140234 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In853140234 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out853140234| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In853140234 |P2Thread1of1ForFork1_#t~ite37_Out853140234|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In853140234, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In853140234, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In853140234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In853140234} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out853140234|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In853140234, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In853140234, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In853140234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In853140234} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:59:40,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L802-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_30| v_~x$r_buff1_thd3~0_133) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1))) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} 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_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, 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 12:59:40,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L829-->L831-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= (mod v_~x$r_buff0_thd0~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:59:40,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-2-->L831-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2131660596 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2131660596 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out2131660596| ~x~0_In2131660596) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In2131660596 |ULTIMATE.start_main_#t~ite41_Out2131660596|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2131660596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131660596, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131660596, ~x~0=~x~0_In2131660596} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2131660596|, ~x$w_buff1~0=~x$w_buff1~0_In2131660596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131660596, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131660596, ~x~0=~x~0_In2131660596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 12:59:40,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L831-4-->L832: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 12:59:40,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1506706903 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1506706903 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1506706903| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1506706903| ~x$w_buff0_used~0_In1506706903) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1506706903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1506706903} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1506706903, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1506706903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1506706903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:59:40,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1376975148 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1376975148 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1376975148 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1376975148 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1376975148 |ULTIMATE.start_main_#t~ite44_Out-1376975148|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1376975148|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376975148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376975148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376975148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376975148} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376975148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376975148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376975148, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1376975148|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376975148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:59:40,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-660881836 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-660881836 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-660881836| ~x$r_buff0_thd0~0_In-660881836)) (and (= |ULTIMATE.start_main_#t~ite45_Out-660881836| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660881836, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660881836} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660881836, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-660881836|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660881836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:59:40,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2078550954 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-2078550954 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-2078550954 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-2078550954 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-2078550954| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-2078550954| ~x$r_buff1_thd0~0_In-2078550954)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2078550954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2078550954, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2078550954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078550954} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2078550954, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2078550954|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2078550954, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2078550954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078550954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:59:40,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L835-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite46_58|) (= v_~__unbuffered_p2_EBX~0_32 0) (= 2 v_~__unbuffered_p2_EAX~0_32) (= v_~main$tmp_guard1~0_25 0) (= v_~y~0_146 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_18| (mod v_~main$tmp_guard1~0_25 256)) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~y~0=v_~y~0_146} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~y~0=v_~y~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_18|} 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 12:59:40,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:59:40 BasicIcfg [2019-12-18 12:59:40,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:59:40,832 INFO L168 Benchmark]: Toolchain (without parser) took 184193.25 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.8 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 527.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,833 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.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 12:59:40,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.23 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 156.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,837 INFO L168 Benchmark]: Boogie Preprocessor took 44.11 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,838 INFO L168 Benchmark]: RCFGBuilder took 808.09 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 104.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,839 INFO L168 Benchmark]: TraceAbstraction took 182483.41 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 467.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:59:40,841 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.23 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 156.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.11 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.09 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 104.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182483.41 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 467.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6794 VarBasedMoverChecksPositive, 260 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 73051 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t672, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L823] FCALL, FORK 0 pthread_create(&t673, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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] [L825] FCALL, FORK 0 pthread_create(&t674, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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 y = 2 [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, z=0] [L798] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, z=0] [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) [L732] 1 z = 1 [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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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=2, 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)) [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 [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? 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))=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=2, z=1] [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)) [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_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=2, z=1] [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 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: 182.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 56.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4009 SDtfs, 5334 SDslu, 9622 SDs, 0 SdLazy, 9691 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 31 SyntacticMatches, 24 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173869occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 103.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 169563 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 123814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...