/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/mix027_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:02:20,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:02:20,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:02:20,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:02:20,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:02:20,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:02:20,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:02:20,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:02:20,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:02:20,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:02:20,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:02:20,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:02:20,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:02:20,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:02:20,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:02:20,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:02:20,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:02:20,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:02:20,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:02:20,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:02:20,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:02:20,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:02:20,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:02:20,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:02:20,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:02:20,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:02:20,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:02:20,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:02:20,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:02:20,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:02:20,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:02:20,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:02:20,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:02:20,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:02:20,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:02:20,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:02:20,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:02:20,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:02:20,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:02:20,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:02:20,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:02:20,600 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 13:02:20,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:02:20,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:02:20,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:02:20,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:02:20,621 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:02:20,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:02:20,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:02:20,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:02:20,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:02:20,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:02:20,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:02:20,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:02:20,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:02:20,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:02:20,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:02:20,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:02:20,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:02:20,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:02:20,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:02:20,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:02:20,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:02:20,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:02:20,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:02:20,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:02:20,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:02:20,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:02:20,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:02:20,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:02:20,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:02:20,926 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:02:20,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 13:02:20,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ee054ba/6bafc96ab5224d8591cd4bf8fb87835a/FLAG20e80e499 [2019-12-18 13:02:21,521 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:02:21,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_pso.opt.i [2019-12-18 13:02:21,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ee054ba/6bafc96ab5224d8591cd4bf8fb87835a/FLAG20e80e499 [2019-12-18 13:02:21,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ee054ba/6bafc96ab5224d8591cd4bf8fb87835a [2019-12-18 13:02:21,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:02:21,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:02:21,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:02:21,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:02:21,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:02:21,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:02:21" (1/1) ... [2019-12-18 13:02:21,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:21, skipping insertion in model container [2019-12-18 13:02:21,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:02:21" (1/1) ... [2019-12-18 13:02:21,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:02:21,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:02:22,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:02:22,428 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:02:22,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:02:22,613 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:02:22,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22 WrapperNode [2019-12-18 13:02:22,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:02:22,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:02:22,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:02:22,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:02:22,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:02:22,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:02:22,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:02:22,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:02:22,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (1/1) ... [2019-12-18 13:02:22,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:02:22,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:02:22,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:02:22,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:02:22,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (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 13:02:22,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:02:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:02:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:02:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:02:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:02:22,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:02:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:02:22,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:02:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:02:22,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:02:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:02:22,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:02:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:02:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:02:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:02:22,792 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 13:02:23,490 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:02:23,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:02:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:02:23 BoogieIcfgContainer [2019-12-18 13:02:23,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:02:23,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:02:23,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:02:23,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:02:23,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:02:21" (1/3) ... [2019-12-18 13:02:23,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ea1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:02:23, skipping insertion in model container [2019-12-18 13:02:23,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:02:22" (2/3) ... [2019-12-18 13:02:23,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ea1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:02:23, skipping insertion in model container [2019-12-18 13:02:23,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:02:23" (3/3) ... [2019-12-18 13:02:23,502 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-18 13:02:23,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:02:23,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:02:23,525 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:02:23,526 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:02:23,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,644 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,644 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,657 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,659 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,674 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,675 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,675 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:02:23,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:02:23,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:02:23,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:02:23,714 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:02:23,714 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:02:23,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:02:23,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:02:23,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:02:23,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:02:23,732 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 13:02:23,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:02:23,822 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:02:23,822 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:02:23,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:02:23,873 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:02:23,921 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:02:23,922 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:02:23,932 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:02:23,958 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 13:02:23,960 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:02:29,122 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 13:02:29,226 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 13:02:29,369 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-18 13:02:29,678 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 13:02:29,839 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 13:02:29,881 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-18 13:02:29,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:02:29,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 13:03:08,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-18 13:03:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-18 13:03:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:03:08,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:03:08,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:03:08,066 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:03:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:03:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-18 13:03:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:03:08,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328101383] [2019-12-18 13:03:08,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:03:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:03:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:03:08,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328101383] [2019-12-18 13:03:08,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:03:08,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:03:08,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915887284] [2019-12-18 13:03:08,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:03:08,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:03:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:03:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:03:08,371 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-18 13:03:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:03:10,020 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-18 13:03:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:03:10,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:03:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:03:15,816 INFO L225 Difference]: With dead ends: 169554 [2019-12-18 13:03:15,816 INFO L226 Difference]: Without dead ends: 159076 [2019-12-18 13:03:15,818 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 13:03:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-18 13:03:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-18 13:03:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-18 13:03:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-18 13:03:28,461 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-18 13:03:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:03:28,462 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-18 13:03:28,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:03:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-18 13:03:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:03:28,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:03:28,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:03:28,475 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:03:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:03:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-18 13:03:28,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:03:28,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958660922] [2019-12-18 13:03:28,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:03:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:03:28,630 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 13:03:28,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958660922] [2019-12-18 13:03:28,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:03:28,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:03:28,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481420639] [2019-12-18 13:03:28,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:03:28,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:03:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:03:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:03:28,634 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-18 13:03:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:03:36,548 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-18 13:03:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:03:36,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:03:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:03:38,278 INFO L225 Difference]: With dead ends: 251868 [2019-12-18 13:03:38,278 INFO L226 Difference]: Without dead ends: 251658 [2019-12-18 13:03:38,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:03:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-18 13:03:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-18 13:03:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-18 13:04:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-18 13:04:06,772 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-18 13:04:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:06,773 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-18 13:04:06,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:04:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-18 13:04:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:04:06,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:06,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:06,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-18 13:04:06,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:06,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083112965] [2019-12-18 13:04:06,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:06,839 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 13:04:06,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083112965] [2019-12-18 13:04:06,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:06,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:04:06,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87738777] [2019-12-18 13:04:06,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:06,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:06,841 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-18 13:04:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:07,559 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-18 13:04:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:07,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:04:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:07,968 INFO L225 Difference]: With dead ends: 146539 [2019-12-18 13:04:07,968 INFO L226 Difference]: Without dead ends: 146539 [2019-12-18 13:04:07,968 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 13:04:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-18 13:04:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-18 13:04:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-18 13:04:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-18 13:04:24,884 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-18 13:04:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:24,884 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-18 13:04:24,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-18 13:04:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:04:24,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:24,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:24,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-18 13:04:24,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:24,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991258357] [2019-12-18 13:04:24,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:24,947 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 13:04:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991258357] [2019-12-18 13:04:24,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:04:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443575691] [2019-12-18 13:04:24,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:04:24,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:04:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:04:24,949 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-18 13:04:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:25,173 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-18 13:04:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:04:25,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:04:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:25,250 INFO L225 Difference]: With dead ends: 40251 [2019-12-18 13:04:25,250 INFO L226 Difference]: Without dead ends: 40251 [2019-12-18 13:04:25,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:04:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-18 13:04:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-18 13:04:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-18 13:04:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-18 13:04:25,969 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-18 13:04:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:25,969 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-18 13:04:25,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:04:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-18 13:04:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:04:25,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:25,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:25,972 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-18 13:04:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:25,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088558925] [2019-12-18 13:04:25,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:26,052 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 13:04:26,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088558925] [2019-12-18 13:04:26,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:26,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:04:26,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815495130] [2019-12-18 13:04:26,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:04:26,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:04:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:04:26,055 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-18 13:04:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:28,992 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-18 13:04:28,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:04:28,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:04:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:29,109 INFO L225 Difference]: With dead ends: 58215 [2019-12-18 13:04:29,109 INFO L226 Difference]: Without dead ends: 58197 [2019-12-18 13:04:29,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:04:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-18 13:04:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-18 13:04:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-18 13:04:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-18 13:04:30,048 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-18 13:04:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:30,049 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-18 13:04:30,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:04:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-18 13:04:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:04:30,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:30,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:30,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-18 13:04:30,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:30,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914889355] [2019-12-18 13:04:30,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:30,229 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 13:04:30,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914889355] [2019-12-18 13:04:30,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:30,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:04:30,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133780952] [2019-12-18 13:04:30,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:04:30,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:30,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:04:30,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:04:30,234 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-18 13:04:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:31,602 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-18 13:04:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:04:31,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:04:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:31,750 INFO L225 Difference]: With dead ends: 73096 [2019-12-18 13:04:31,750 INFO L226 Difference]: Without dead ends: 73066 [2019-12-18 13:04:31,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:04:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-18 13:04:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-18 13:04:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-18 13:04:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-18 13:04:33,436 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-18 13:04:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:33,437 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-18 13:04:33,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:04:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-18 13:04:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:04:33,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:33,452 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] [2019-12-18 13:04:33,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:33,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-18 13:04:33,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:33,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2607515] [2019-12-18 13:04:33,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:04:33,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2607515] [2019-12-18 13:04:33,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:33,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:04:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650113112] [2019-12-18 13:04:33,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:04:33,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:04:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:04:33,549 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-18 13:04:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:34,621 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-18 13:04:34,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:04:34,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:04:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:34,871 INFO L225 Difference]: With dead ends: 73479 [2019-12-18 13:04:34,871 INFO L226 Difference]: Without dead ends: 73449 [2019-12-18 13:04:34,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:04:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-18 13:04:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-18 13:04:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-18 13:04:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-18 13:04:36,613 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-18 13:04:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:36,613 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-18 13:04:36,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:04:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-18 13:04:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:04:36,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:36,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:36,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-18 13:04:36,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:36,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221579137] [2019-12-18 13:04:36,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:36,708 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 13:04:36,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221579137] [2019-12-18 13:04:36,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:36,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:04:36,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636555153] [2019-12-18 13:04:36,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:04:36,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:04:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:04:36,710 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-18 13:04:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:36,856 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-18 13:04:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:04:36,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:04:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:36,905 INFO L225 Difference]: With dead ends: 26235 [2019-12-18 13:04:36,905 INFO L226 Difference]: Without dead ends: 26235 [2019-12-18 13:04:36,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:04:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-18 13:04:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-18 13:04:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 13:04:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-18 13:04:37,360 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-18 13:04:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:37,360 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-18 13:04:37,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:04:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-18 13:04:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:04:37,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:37,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:37,407 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-18 13:04:37,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:37,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841438939] [2019-12-18 13:04:37,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:37,488 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 13:04:37,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841438939] [2019-12-18 13:04:37,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:37,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:04:37,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16419629] [2019-12-18 13:04:37,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:04:37,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:37,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:04:37,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:04:37,492 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 4 states. [2019-12-18 13:04:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:37,693 INFO L93 Difference]: Finished difference Result 37412 states and 127885 transitions. [2019-12-18 13:04:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:04:37,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 13:04:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:39,463 INFO L225 Difference]: With dead ends: 37412 [2019-12-18 13:04:39,463 INFO L226 Difference]: Without dead ends: 26234 [2019-12-18 13:04:39,463 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 13:04:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26234 states. [2019-12-18 13:04:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26234 to 26084. [2019-12-18 13:04:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26084 states. [2019-12-18 13:04:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26084 states to 26084 states and 92286 transitions. [2019-12-18 13:04:39,907 INFO L78 Accepts]: Start accepts. Automaton has 26084 states and 92286 transitions. Word has length 42 [2019-12-18 13:04:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:39,907 INFO L462 AbstractCegarLoop]: Abstraction has 26084 states and 92286 transitions. [2019-12-18 13:04:39,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:04:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26084 states and 92286 transitions. [2019-12-18 13:04:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:04:39,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:39,944 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] [2019-12-18 13:04:39,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-18 13:04:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551415331] [2019-12-18 13:04:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:40,000 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 13:04:40,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551415331] [2019-12-18 13:04:40,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:40,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:04:40,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630885827] [2019-12-18 13:04:40,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:40,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:40,003 INFO L87 Difference]: Start difference. First operand 26084 states and 92286 transitions. Second operand 3 states. [2019-12-18 13:04:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:40,183 INFO L93 Difference]: Finished difference Result 39452 states and 132645 transitions. [2019-12-18 13:04:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 13:04:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:40,230 INFO L225 Difference]: With dead ends: 39452 [2019-12-18 13:04:40,230 INFO L226 Difference]: Without dead ends: 26924 [2019-12-18 13:04:40,231 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 13:04:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-18 13:04:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 25835. [2019-12-18 13:04:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-18 13:04:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 79997 transitions. [2019-12-18 13:04:40,651 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 79997 transitions. Word has length 42 [2019-12-18 13:04:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:40,652 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 79997 transitions. [2019-12-18 13:04:40,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 79997 transitions. [2019-12-18 13:04:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 13:04:40,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:40,686 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] [2019-12-18 13:04:40,686 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-18 13:04:40,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:40,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044315544] [2019-12-18 13:04:40,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:40,765 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 13:04:40,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044315544] [2019-12-18 13:04:40,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:04:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486849546] [2019-12-18 13:04:40,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:04:40,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:04:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:04:40,767 INFO L87 Difference]: Start difference. First operand 25835 states and 79997 transitions. Second operand 6 states. [2019-12-18 13:04:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:40,910 INFO L93 Difference]: Finished difference Result 24507 states and 76659 transitions. [2019-12-18 13:04:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:04:40,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 13:04:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:41,109 INFO L225 Difference]: With dead ends: 24507 [2019-12-18 13:04:41,110 INFO L226 Difference]: Without dead ends: 10719 [2019-12-18 13:04:41,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:04:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10719 states. [2019-12-18 13:04:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10719 to 10341. [2019-12-18 13:04:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-12-18 13:04:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 32248 transitions. [2019-12-18 13:04:41,334 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 32248 transitions. Word has length 43 [2019-12-18 13:04:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:41,334 INFO L462 AbstractCegarLoop]: Abstraction has 10341 states and 32248 transitions. [2019-12-18 13:04:41,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:04:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 32248 transitions. [2019-12-18 13:04:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:41,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:41,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:41,350 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:41,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -360004126, now seen corresponding path program 1 times [2019-12-18 13:04:41,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:41,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203853854] [2019-12-18 13:04:41,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:41,405 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 13:04:41,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203853854] [2019-12-18 13:04:41,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:41,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:04:41,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062624065] [2019-12-18 13:04:41,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:41,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:41,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:41,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:41,407 INFO L87 Difference]: Start difference. First operand 10341 states and 32248 transitions. Second operand 3 states. [2019-12-18 13:04:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:41,491 INFO L93 Difference]: Finished difference Result 13894 states and 42635 transitions. [2019-12-18 13:04:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:41,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:04:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:41,510 INFO L225 Difference]: With dead ends: 13894 [2019-12-18 13:04:41,510 INFO L226 Difference]: Without dead ends: 13894 [2019-12-18 13:04:41,510 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 13:04:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-12-18 13:04:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 11246. [2019-12-18 13:04:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-12-18 13:04:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35029 transitions. [2019-12-18 13:04:41,701 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 35029 transitions. Word has length 57 [2019-12-18 13:04:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:41,701 INFO L462 AbstractCegarLoop]: Abstraction has 11246 states and 35029 transitions. [2019-12-18 13:04:41,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 35029 transitions. [2019-12-18 13:04:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:41,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:41,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:41,714 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-18 13:04:41,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:41,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369636952] [2019-12-18 13:04:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:41,815 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 13:04:41,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369636952] [2019-12-18 13:04:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:04:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219279157] [2019-12-18 13:04:41,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:04:41,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:04:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:04:41,817 INFO L87 Difference]: Start difference. First operand 11246 states and 35029 transitions. Second operand 7 states. [2019-12-18 13:04:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:42,266 INFO L93 Difference]: Finished difference Result 31203 states and 96822 transitions. [2019-12-18 13:04:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:04:42,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:04:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:42,301 INFO L225 Difference]: With dead ends: 31203 [2019-12-18 13:04:42,302 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 13:04:42,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:04:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 13:04:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 14347. [2019-12-18 13:04:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-18 13:04:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 45043 transitions. [2019-12-18 13:04:42,614 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 45043 transitions. Word has length 57 [2019-12-18 13:04:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:42,615 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 45043 transitions. [2019-12-18 13:04:42,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:04:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 45043 transitions. [2019-12-18 13:04:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:42,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:42,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:42,631 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-18 13:04:42,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:42,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177932021] [2019-12-18 13:04:42,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:42,740 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 13:04:42,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177932021] [2019-12-18 13:04:42,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:42,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:04:42,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798340409] [2019-12-18 13:04:42,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:04:42,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:04:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:04:42,742 INFO L87 Difference]: Start difference. First operand 14347 states and 45043 transitions. Second operand 6 states. [2019-12-18 13:04:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:43,102 INFO L93 Difference]: Finished difference Result 36806 states and 112743 transitions. [2019-12-18 13:04:43,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:04:43,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 13:04:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:43,141 INFO L225 Difference]: With dead ends: 36806 [2019-12-18 13:04:43,141 INFO L226 Difference]: Without dead ends: 26675 [2019-12-18 13:04:43,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:04:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2019-12-18 13:04:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 16874. [2019-12-18 13:04:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16874 states. [2019-12-18 13:04:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16874 states to 16874 states and 52931 transitions. [2019-12-18 13:04:43,614 INFO L78 Accepts]: Start accepts. Automaton has 16874 states and 52931 transitions. Word has length 57 [2019-12-18 13:04:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:43,614 INFO L462 AbstractCegarLoop]: Abstraction has 16874 states and 52931 transitions. [2019-12-18 13:04:43,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:04:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16874 states and 52931 transitions. [2019-12-18 13:04:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:43,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:43,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:43,633 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-18 13:04:43,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:43,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420955523] [2019-12-18 13:04:43,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:43,714 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 13:04:43,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420955523] [2019-12-18 13:04:43,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:43,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:04:43,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553325155] [2019-12-18 13:04:43,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:04:43,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:43,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:04:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:04:43,716 INFO L87 Difference]: Start difference. First operand 16874 states and 52931 transitions. Second operand 7 states. [2019-12-18 13:04:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:44,079 INFO L93 Difference]: Finished difference Result 29867 states and 90934 transitions. [2019-12-18 13:04:44,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:04:44,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:04:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:44,120 INFO L225 Difference]: With dead ends: 29867 [2019-12-18 13:04:44,121 INFO L226 Difference]: Without dead ends: 27808 [2019-12-18 13:04:44,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:04:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27808 states. [2019-12-18 13:04:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27808 to 16938. [2019-12-18 13:04:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 13:04:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 53162 transitions. [2019-12-18 13:04:44,470 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 53162 transitions. Word has length 57 [2019-12-18 13:04:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 53162 transitions. [2019-12-18 13:04:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:04:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 53162 transitions. [2019-12-18 13:04:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:44,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:44,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:44,489 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143536, now seen corresponding path program 1 times [2019-12-18 13:04:44,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:44,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914191054] [2019-12-18 13:04:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:44,539 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 13:04:44,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914191054] [2019-12-18 13:04:44,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:44,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:04:44,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256169778] [2019-12-18 13:04:44,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:44,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:44,541 INFO L87 Difference]: Start difference. First operand 16938 states and 53162 transitions. Second operand 3 states. [2019-12-18 13:04:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:44,649 INFO L93 Difference]: Finished difference Result 18741 states and 57074 transitions. [2019-12-18 13:04:44,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:44,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:04:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:44,682 INFO L225 Difference]: With dead ends: 18741 [2019-12-18 13:04:44,683 INFO L226 Difference]: Without dead ends: 18741 [2019-12-18 13:04:44,683 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 13:04:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-18 13:04:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 16938. [2019-12-18 13:04:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 13:04:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51972 transitions. [2019-12-18 13:04:45,136 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51972 transitions. Word has length 57 [2019-12-18 13:04:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:45,137 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51972 transitions. [2019-12-18 13:04:45,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51972 transitions. [2019-12-18 13:04:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:45,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:45,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:45,163 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-18 13:04:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:45,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431469070] [2019-12-18 13:04:45,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:45,240 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 13:04:45,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431469070] [2019-12-18 13:04:45,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:45,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:04:45,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346213911] [2019-12-18 13:04:45,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:04:45,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:04:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:04:45,243 INFO L87 Difference]: Start difference. First operand 16938 states and 51972 transitions. Second operand 7 states. [2019-12-18 13:04:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:45,702 INFO L93 Difference]: Finished difference Result 33067 states and 98644 transitions. [2019-12-18 13:04:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:04:45,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:04:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:45,741 INFO L225 Difference]: With dead ends: 33067 [2019-12-18 13:04:45,741 INFO L226 Difference]: Without dead ends: 27923 [2019-12-18 13:04:45,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:04:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27923 states. [2019-12-18 13:04:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27923 to 17148. [2019-12-18 13:04:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-18 13:04:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 52559 transitions. [2019-12-18 13:04:46,080 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 52559 transitions. Word has length 57 [2019-12-18 13:04:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:46,081 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 52559 transitions. [2019-12-18 13:04:46,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:04:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 52559 transitions. [2019-12-18 13:04:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:46,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:46,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:46,099 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-18 13:04:46,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:46,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931866064] [2019-12-18 13:04:46,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:04:46,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931866064] [2019-12-18 13:04:46,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:46,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:04:46,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404281476] [2019-12-18 13:04:46,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:04:46,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:46,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:04:46,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:04:46,202 INFO L87 Difference]: Start difference. First operand 17148 states and 52559 transitions. Second operand 5 states. [2019-12-18 13:04:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:46,739 INFO L93 Difference]: Finished difference Result 26314 states and 78268 transitions. [2019-12-18 13:04:46,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:04:46,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 13:04:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:46,780 INFO L225 Difference]: With dead ends: 26314 [2019-12-18 13:04:46,780 INFO L226 Difference]: Without dead ends: 26188 [2019-12-18 13:04:46,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 13:04:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26188 states. [2019-12-18 13:04:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26188 to 20073. [2019-12-18 13:04:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20073 states. [2019-12-18 13:04:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 61009 transitions. [2019-12-18 13:04:47,162 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 61009 transitions. Word has length 57 [2019-12-18 13:04:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:47,163 INFO L462 AbstractCegarLoop]: Abstraction has 20073 states and 61009 transitions. [2019-12-18 13:04:47,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:04:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 61009 transitions. [2019-12-18 13:04:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:47,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:47,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:47,187 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-18 13:04:47,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:47,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512656930] [2019-12-18 13:04:47,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:47,322 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 13:04:47,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512656930] [2019-12-18 13:04:47,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:47,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:04:47,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066403896] [2019-12-18 13:04:47,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:04:47,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:47,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:04:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:04:47,324 INFO L87 Difference]: Start difference. First operand 20073 states and 61009 transitions. Second operand 8 states. [2019-12-18 13:04:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:48,516 INFO L93 Difference]: Finished difference Result 27381 states and 81339 transitions. [2019-12-18 13:04:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:04:48,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 13:04:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:48,552 INFO L225 Difference]: With dead ends: 27381 [2019-12-18 13:04:48,552 INFO L226 Difference]: Without dead ends: 27381 [2019-12-18 13:04:48,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:04:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-18 13:04:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 20271. [2019-12-18 13:04:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20271 states. [2019-12-18 13:04:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 61591 transitions. [2019-12-18 13:04:48,897 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 61591 transitions. Word has length 57 [2019-12-18 13:04:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:48,898 INFO L462 AbstractCegarLoop]: Abstraction has 20271 states and 61591 transitions. [2019-12-18 13:04:48,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:04:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 61591 transitions. [2019-12-18 13:04:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:48,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:48,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:48,920 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-18 13:04:48,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:48,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288909113] [2019-12-18 13:04:48,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:49,068 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 13:04:49,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288909113] [2019-12-18 13:04:49,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:49,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:04:49,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542248220] [2019-12-18 13:04:49,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:04:49,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:49,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:04:49,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:04:49,070 INFO L87 Difference]: Start difference. First operand 20271 states and 61591 transitions. Second operand 9 states. [2019-12-18 13:04:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:50,404 INFO L93 Difference]: Finished difference Result 29033 states and 85853 transitions. [2019-12-18 13:04:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:04:50,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 13:04:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:50,444 INFO L225 Difference]: With dead ends: 29033 [2019-12-18 13:04:50,445 INFO L226 Difference]: Without dead ends: 29033 [2019-12-18 13:04:50,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:04:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29033 states. [2019-12-18 13:04:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29033 to 23020. [2019-12-18 13:04:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-18 13:04:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 69387 transitions. [2019-12-18 13:04:50,852 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 69387 transitions. Word has length 57 [2019-12-18 13:04:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:50,852 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 69387 transitions. [2019-12-18 13:04:50,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:04:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 69387 transitions. [2019-12-18 13:04:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:50,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:50,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:50,879 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-18 13:04:50,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:50,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997584434] [2019-12-18 13:04:50,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:51,037 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 13:04:51,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997584434] [2019-12-18 13:04:51,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:51,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:04:51,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042664534] [2019-12-18 13:04:51,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:04:51,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:04:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:04:51,039 INFO L87 Difference]: Start difference. First operand 23020 states and 69387 transitions. Second operand 9 states. [2019-12-18 13:04:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:52,575 INFO L93 Difference]: Finished difference Result 35444 states and 103738 transitions. [2019-12-18 13:04:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:04:52,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 13:04:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:52,625 INFO L225 Difference]: With dead ends: 35444 [2019-12-18 13:04:52,625 INFO L226 Difference]: Without dead ends: 35156 [2019-12-18 13:04:52,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:04:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35156 states. [2019-12-18 13:04:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35156 to 25598. [2019-12-18 13:04:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25598 states. [2019-12-18 13:04:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25598 states to 25598 states and 76158 transitions. [2019-12-18 13:04:53,123 INFO L78 Accepts]: Start accepts. Automaton has 25598 states and 76158 transitions. Word has length 57 [2019-12-18 13:04:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:53,123 INFO L462 AbstractCegarLoop]: Abstraction has 25598 states and 76158 transitions. [2019-12-18 13:04:53,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:04:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 25598 states and 76158 transitions. [2019-12-18 13:04:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:53,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:53,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:53,149 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-18 13:04:53,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:53,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733272825] [2019-12-18 13:04:53,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:53,323 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 13:04:53,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733272825] [2019-12-18 13:04:53,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:53,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:04:53,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165234251] [2019-12-18 13:04:53,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:04:53,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:04:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:04:53,325 INFO L87 Difference]: Start difference. First operand 25598 states and 76158 transitions. Second operand 10 states. [2019-12-18 13:04:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:55,198 INFO L93 Difference]: Finished difference Result 43300 states and 126781 transitions. [2019-12-18 13:04:55,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:04:55,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-18 13:04:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:55,261 INFO L225 Difference]: With dead ends: 43300 [2019-12-18 13:04:55,261 INFO L226 Difference]: Without dead ends: 43111 [2019-12-18 13:04:55,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:04:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-18 13:04:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 26559. [2019-12-18 13:04:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26559 states. [2019-12-18 13:04:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26559 states to 26559 states and 79086 transitions. [2019-12-18 13:04:55,967 INFO L78 Accepts]: Start accepts. Automaton has 26559 states and 79086 transitions. Word has length 57 [2019-12-18 13:04:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:55,967 INFO L462 AbstractCegarLoop]: Abstraction has 26559 states and 79086 transitions. [2019-12-18 13:04:55,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:04:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26559 states and 79086 transitions. [2019-12-18 13:04:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:04:56,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:56,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:56,002 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-18 13:04:56,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:56,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848307925] [2019-12-18 13:04:56,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:56,187 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 13:04:56,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848307925] [2019-12-18 13:04:56,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:56,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:04:56,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541548872] [2019-12-18 13:04:56,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:04:56,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:56,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:04:56,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:04:56,191 INFO L87 Difference]: Start difference. First operand 26559 states and 79086 transitions. Second operand 12 states. [2019-12-18 13:04:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:59,231 INFO L93 Difference]: Finished difference Result 42821 states and 124875 transitions. [2019-12-18 13:04:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:04:59,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:04:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:59,293 INFO L225 Difference]: With dead ends: 42821 [2019-12-18 13:04:59,293 INFO L226 Difference]: Without dead ends: 42599 [2019-12-18 13:04:59,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:04:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42599 states. [2019-12-18 13:04:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42599 to 26419. [2019-12-18 13:04:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26419 states. [2019-12-18 13:05:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26419 states to 26419 states and 78660 transitions. [2019-12-18 13:05:00,051 INFO L78 Accepts]: Start accepts. Automaton has 26419 states and 78660 transitions. Word has length 57 [2019-12-18 13:05:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:00,052 INFO L462 AbstractCegarLoop]: Abstraction has 26419 states and 78660 transitions. [2019-12-18 13:05:00,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:05:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26419 states and 78660 transitions. [2019-12-18 13:05:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:00,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:00,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:00,080 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2075339129, now seen corresponding path program 11 times [2019-12-18 13:05:00,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:00,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937757381] [2019-12-18 13:05:00,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:00,177 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 13:05:00,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937757381] [2019-12-18 13:05:00,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:00,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:05:00,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683317969] [2019-12-18 13:05:00,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:00,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:00,179 INFO L87 Difference]: Start difference. First operand 26419 states and 78660 transitions. Second operand 7 states. [2019-12-18 13:05:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:01,427 INFO L93 Difference]: Finished difference Result 37944 states and 110419 transitions. [2019-12-18 13:05:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:05:01,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 13:05:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:01,487 INFO L225 Difference]: With dead ends: 37944 [2019-12-18 13:05:01,487 INFO L226 Difference]: Without dead ends: 37944 [2019-12-18 13:05:01,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:05:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37944 states. [2019-12-18 13:05:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37944 to 25437. [2019-12-18 13:05:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25437 states. [2019-12-18 13:05:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25437 states to 25437 states and 75843 transitions. [2019-12-18 13:05:01,985 INFO L78 Accepts]: Start accepts. Automaton has 25437 states and 75843 transitions. Word has length 57 [2019-12-18 13:05:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:01,985 INFO L462 AbstractCegarLoop]: Abstraction has 25437 states and 75843 transitions. [2019-12-18 13:05:01,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25437 states and 75843 transitions. [2019-12-18 13:05:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:02,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:02,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:02,026 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash 817096895, now seen corresponding path program 12 times [2019-12-18 13:05:02,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:02,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091262086] [2019-12-18 13:05:02,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:02,153 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 13:05:02,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091262086] [2019-12-18 13:05:02,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:02,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:05:02,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887708565] [2019-12-18 13:05:02,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:02,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:02,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:02,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:02,155 INFO L87 Difference]: Start difference. First operand 25437 states and 75843 transitions. Second operand 9 states. [2019-12-18 13:05:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:03,948 INFO L93 Difference]: Finished difference Result 37812 states and 110017 transitions. [2019-12-18 13:05:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:05:03,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 13:05:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:03,994 INFO L225 Difference]: With dead ends: 37812 [2019-12-18 13:05:03,994 INFO L226 Difference]: Without dead ends: 37812 [2019-12-18 13:05:03,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:05:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37812 states. [2019-12-18 13:05:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37812 to 22732. [2019-12-18 13:05:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22732 states. [2019-12-18 13:05:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22732 states to 22732 states and 67894 transitions. [2019-12-18 13:05:04,421 INFO L78 Accepts]: Start accepts. Automaton has 22732 states and 67894 transitions. Word has length 57 [2019-12-18 13:05:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:04,422 INFO L462 AbstractCegarLoop]: Abstraction has 22732 states and 67894 transitions. [2019-12-18 13:05:04,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22732 states and 67894 transitions. [2019-12-18 13:05:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:04,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:04,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:04,448 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1385383185, now seen corresponding path program 13 times [2019-12-18 13:05:04,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:04,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220246933] [2019-12-18 13:05:04,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:04,581 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 13:05:04,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220246933] [2019-12-18 13:05:04,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:04,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:05:04,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446110604] [2019-12-18 13:05:04,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:04,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:04,583 INFO L87 Difference]: Start difference. First operand 22732 states and 67894 transitions. Second operand 9 states. [2019-12-18 13:05:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:05,829 INFO L93 Difference]: Finished difference Result 41811 states and 123811 transitions. [2019-12-18 13:05:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:05:05,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 13:05:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:05,891 INFO L225 Difference]: With dead ends: 41811 [2019-12-18 13:05:05,891 INFO L226 Difference]: Without dead ends: 41699 [2019-12-18 13:05:05,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:05:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41699 states. [2019-12-18 13:05:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41699 to 24829. [2019-12-18 13:05:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24829 states. [2019-12-18 13:05:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 74272 transitions. [2019-12-18 13:05:06,404 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 74272 transitions. Word has length 57 [2019-12-18 13:05:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:06,405 INFO L462 AbstractCegarLoop]: Abstraction has 24829 states and 74272 transitions. [2019-12-18 13:05:06,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 74272 transitions. [2019-12-18 13:05:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:05:06,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:06,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:06,430 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 226977995, now seen corresponding path program 14 times [2019-12-18 13:05:06,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:06,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615846796] [2019-12-18 13:05:06,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:06,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 13:05:06,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615846796] [2019-12-18 13:05:06,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:06,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:06,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316149125] [2019-12-18 13:05:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:06,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:06,496 INFO L87 Difference]: Start difference. First operand 24829 states and 74272 transitions. Second operand 3 states. [2019-12-18 13:05:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:06,578 INFO L93 Difference]: Finished difference Result 19478 states and 57695 transitions. [2019-12-18 13:05:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:06,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:05:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:06,614 INFO L225 Difference]: With dead ends: 19478 [2019-12-18 13:05:06,614 INFO L226 Difference]: Without dead ends: 19478 [2019-12-18 13:05:06,614 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 13:05:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19478 states. [2019-12-18 13:05:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19478 to 18971. [2019-12-18 13:05:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18971 states. [2019-12-18 13:05:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18971 states to 18971 states and 56167 transitions. [2019-12-18 13:05:07,029 INFO L78 Accepts]: Start accepts. Automaton has 18971 states and 56167 transitions. Word has length 57 [2019-12-18 13:05:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:07,029 INFO L462 AbstractCegarLoop]: Abstraction has 18971 states and 56167 transitions. [2019-12-18 13:05:07,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 18971 states and 56167 transitions. [2019-12-18 13:05:07,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:05:07,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:07,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:07,047 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:07,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash 49311194, now seen corresponding path program 1 times [2019-12-18 13:05:07,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:07,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249453724] [2019-12-18 13:05:07,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:07,326 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 13:05:07,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249453724] [2019-12-18 13:05:07,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:07,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:05:07,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654488652] [2019-12-18 13:05:07,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:05:07,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:05:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:05:07,328 INFO L87 Difference]: Start difference. First operand 18971 states and 56167 transitions. Second operand 12 states. [2019-12-18 13:05:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:11,038 INFO L93 Difference]: Finished difference Result 41883 states and 120967 transitions. [2019-12-18 13:05:11,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 13:05:11,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-18 13:05:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:11,097 INFO L225 Difference]: With dead ends: 41883 [2019-12-18 13:05:11,097 INFO L226 Difference]: Without dead ends: 41883 [2019-12-18 13:05:11,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 13:05:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41883 states. [2019-12-18 13:05:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41883 to 20766. [2019-12-18 13:05:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-12-18 13:05:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 62068 transitions. [2019-12-18 13:05:11,765 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 62068 transitions. Word has length 58 [2019-12-18 13:05:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 20766 states and 62068 transitions. [2019-12-18 13:05:11,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:05:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 62068 transitions. [2019-12-18 13:05:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:05:11,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:11,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:11,785 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 523765896, now seen corresponding path program 2 times [2019-12-18 13:05:11,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:11,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119056531] [2019-12-18 13:05:11,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:11,845 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 13:05:11,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119056531] [2019-12-18 13:05:11,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:11,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:11,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552234057] [2019-12-18 13:05:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:11,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:11,847 INFO L87 Difference]: Start difference. First operand 20766 states and 62068 transitions. Second operand 3 states. [2019-12-18 13:05:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:11,947 INFO L93 Difference]: Finished difference Result 20766 states and 62066 transitions. [2019-12-18 13:05:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:11,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:05:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:11,997 INFO L225 Difference]: With dead ends: 20766 [2019-12-18 13:05:11,998 INFO L226 Difference]: Without dead ends: 20766 [2019-12-18 13:05:11,998 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 13:05:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-12-18 13:05:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 16137. [2019-12-18 13:05:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-18 13:05:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 48669 transitions. [2019-12-18 13:05:12,440 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 48669 transitions. Word has length 58 [2019-12-18 13:05:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:12,440 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 48669 transitions. [2019-12-18 13:05:12,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 48669 transitions. [2019-12-18 13:05:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:05:12,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:12,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:12,463 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-18 13:05:12,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:12,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400667044] [2019-12-18 13:05:12,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:05:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:05:12,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:05:12,586 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:05:12,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:05:12,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:05:12,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:05:12,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:05:12,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-18 13:05:12,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out437405289| |P3Thread1of1ForFork0_#t~ite33_Out437405289|)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In437405289 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In437405289 256)))) (or (and (not .cse0) .cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out437405289| ~y$w_buff1~0_In437405289) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P3Thread1of1ForFork0_#t~ite32_Out437405289| ~y~0_In437405289)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In437405289, ~y$w_buff1~0=~y$w_buff1~0_In437405289, ~y~0=~y~0_In437405289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437405289} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In437405289, ~y$w_buff1~0=~y$w_buff1~0_In437405289, ~y~0=~y~0_In437405289, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out437405289|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out437405289|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437405289} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 13:05:12,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 13:05:12,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1960359188 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1960359188 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-1960359188| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-1960359188| ~y$w_buff0_used~0_In-1960359188)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1960359188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1960359188} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1960359188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1960359188, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1960359188|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 13:05:12,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-14938633 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-14938633 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-14938633 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-14938633 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out-14938633| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out-14938633| ~y$w_buff1_used~0_In-14938633) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-14938633, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-14938633, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-14938633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14938633} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-14938633, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-14938633, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-14938633, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-14938633|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14938633} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 13:05:12,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In304575361 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd4~0_In304575361 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out304575361| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out304575361| ~y$r_buff0_thd4~0_In304575361) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In304575361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In304575361} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In304575361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In304575361, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out304575361|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 13:05:12,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In1402876772 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1402876772 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In1402876772 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1402876772 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out1402876772| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork0_#t~ite37_Out1402876772| ~y$r_buff1_thd4~0_In1402876772)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1402876772, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1402876772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1402876772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402876772} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1402876772, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1402876772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1402876772, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1402876772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402876772} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 13:05:12,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:05:12,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-372116034 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-372116034| |P1Thread1of1ForFork2_#t~ite11_Out-372116034|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-372116034 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-372116034 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-372116034 256)) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-372116034 256))))) .cse1 (= ~y$w_buff1~0_In-372116034 |P1Thread1of1ForFork2_#t~ite11_Out-372116034|)) (and (= |P1Thread1of1ForFork2_#t~ite11_In-372116034| |P1Thread1of1ForFork2_#t~ite11_Out-372116034|) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-372116034| ~y$w_buff1~0_In-372116034)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-372116034, ~y$w_buff1~0=~y$w_buff1~0_In-372116034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-372116034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-372116034, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-372116034|, ~weak$$choice2~0=~weak$$choice2~0_In-372116034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-372116034} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-372116034, ~y$w_buff1~0=~y$w_buff1~0_In-372116034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-372116034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-372116034, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-372116034|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-372116034|, ~weak$$choice2~0=~weak$$choice2~0_In-372116034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-372116034} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:05:12,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In79386792 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In79386792| |P1Thread1of1ForFork2_#t~ite14_Out79386792|) (not .cse0) (= ~y$w_buff0_used~0_In79386792 |P1Thread1of1ForFork2_#t~ite15_Out79386792|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out79386792| ~y$w_buff0_used~0_In79386792) (= |P1Thread1of1ForFork2_#t~ite14_Out79386792| |P1Thread1of1ForFork2_#t~ite15_Out79386792|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In79386792 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In79386792 256)) (and (= 0 (mod ~y$w_buff1_used~0_In79386792 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In79386792 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In79386792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In79386792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In79386792, ~weak$$choice2~0=~weak$$choice2~0_In79386792, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In79386792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In79386792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In79386792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In79386792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In79386792, ~weak$$choice2~0=~weak$$choice2~0_In79386792, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out79386792|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out79386792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In79386792} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 13:05:12,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 13:05:12,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1154051007 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1154051007| ~y$r_buff1_thd2~0_In-1154051007) (= |P1Thread1of1ForFork2_#t~ite23_In-1154051007| |P1Thread1of1ForFork2_#t~ite23_Out-1154051007|) (not .cse0)) (and (= ~y$r_buff1_thd2~0_In-1154051007 |P1Thread1of1ForFork2_#t~ite23_Out-1154051007|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1154051007| |P1Thread1of1ForFork2_#t~ite23_Out-1154051007|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1154051007 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1154051007 256))) (= 0 (mod ~y$w_buff0_used~0_In-1154051007 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1154051007 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1154051007, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154051007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1154051007, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1154051007|, ~weak$$choice2~0=~weak$$choice2~0_In-1154051007, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154051007} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1154051007, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154051007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1154051007, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1154051007|, ~weak$$choice2~0=~weak$$choice2~0_In-1154051007, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1154051007|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154051007} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:05:12,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 13:05:12,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1885600430 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1885600430 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1885600430| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1885600430| ~y$w_buff0_used~0_In-1885600430)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885600430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1885600430} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885600430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1885600430, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1885600430|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 13:05:12,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2057155690 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2057155690 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2057155690 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2057155690 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-2057155690|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-2057155690| ~y$w_buff1_used~0_In-2057155690)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2057155690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2057155690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2057155690, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2057155690} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2057155690, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2057155690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2057155690, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-2057155690|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2057155690} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 13:05:12,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In221946809 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In221946809 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In221946809 ~y$r_buff0_thd3~0_Out221946809)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out221946809 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In221946809, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In221946809} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out221946809|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221946809, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out221946809} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:05:12,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In794256032 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In794256032 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In794256032 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In794256032 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out794256032|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In794256032 |P2Thread1of1ForFork3_#t~ite31_Out794256032|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In794256032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In794256032, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In794256032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794256032} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In794256032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In794256032, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In794256032, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out794256032|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794256032} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 13:05:12,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:05:12,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:05:12,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite43_Out1750799436| |ULTIMATE.start_main_#t~ite42_Out1750799436|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1750799436 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1750799436 256)))) (or (and (= ~y$w_buff1~0_In1750799436 |ULTIMATE.start_main_#t~ite42_Out1750799436|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~y~0_In1750799436 |ULTIMATE.start_main_#t~ite42_Out1750799436|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1750799436, ~y~0=~y~0_In1750799436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1750799436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750799436} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1750799436, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1750799436|, ~y~0=~y~0_In1750799436, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1750799436|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1750799436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750799436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:05:12,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In996196459 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In996196459 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out996196459| ~y$w_buff0_used~0_In996196459) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out996196459| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In996196459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In996196459} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In996196459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In996196459, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out996196459|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:05:12,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1694945734 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1694945734 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1694945734 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1694945734 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1694945734 |ULTIMATE.start_main_#t~ite45_Out-1694945734|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1694945734|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1694945734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1694945734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1694945734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1694945734} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1694945734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1694945734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1694945734, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1694945734|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1694945734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:05:12,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2139557008 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2139557008 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-2139557008| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-2139557008| ~y$r_buff0_thd0~0_In-2139557008) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139557008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139557008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139557008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139557008, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2139557008|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:05:12,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-793355286 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-793355286 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-793355286 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-793355286 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-793355286| ~y$r_buff1_thd0~0_In-793355286) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite47_Out-793355286| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-793355286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-793355286, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-793355286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-793355286} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-793355286, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-793355286, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-793355286|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-793355286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-793355286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:05:12,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:05:12,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:05:12 BasicIcfg [2019-12-18 13:05:12,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:05:12,737 INFO L168 Benchmark]: Toolchain (without parser) took 170879.80 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,737 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.72 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,739 INFO L168 Benchmark]: Boogie Preprocessor took 40.44 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,739 INFO L168 Benchmark]: RCFGBuilder took 775.83 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 102.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,740 INFO L168 Benchmark]: TraceAbstraction took 169241.46 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:05:12,742 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.72 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.44 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.83 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 102.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169241.46 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t728, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 168.8s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6240 SDtfs, 7505 SDslu, 18918 SDs, 0 SdLazy, 14642 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 80 SyntacticMatches, 26 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 256071 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 281867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...