/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/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:36:31,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:36:31,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:36:31,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:36:31,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:36:31,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:36:31,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:36:31,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:36:31,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:36:31,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:36:31,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:36:31,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:36:31,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:36:31,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:36:31,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:36:31,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:36:31,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:36:31,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:36:31,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:36:31,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:36:31,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:36:31,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:36:31,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:36:31,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:36:31,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:36:31,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:36:31,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:36:31,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:36:31,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:36:31,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:36:31,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:36:31,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:36:31,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:36:31,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:36:31,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:36:31,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:36:31,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:36:31,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:36:31,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:36:31,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:36:31,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:36:31,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:36:31,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:36:31,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:36:31,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:36:31,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:36:31,588 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:36:31,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:36:31,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:36:31,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:36:31,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:36:31,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:36:31,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:36:31,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:36:31,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:36:31,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:36:31,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:36:31,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:36:31,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:36:31,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:36:31,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:36:31,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:36:31,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:36:31,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:36:31,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:36:31,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:36:31,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:36:31,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:36:31,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:36:31,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:36:31,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:36:31,900 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:36:31,901 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-26 22:36:31,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a72edfc/4ad40af02cee45a88cc1b961f79c11f9/FLAG2d3abc4f9 [2019-12-26 22:36:32,541 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:36:32,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-26 22:36:32,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a72edfc/4ad40af02cee45a88cc1b961f79c11f9/FLAG2d3abc4f9 [2019-12-26 22:36:32,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a72edfc/4ad40af02cee45a88cc1b961f79c11f9 [2019-12-26 22:36:32,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:36:32,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:36:32,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:32,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:36:32,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:36:32,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:32" (1/1) ... [2019-12-26 22:36:32,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a22961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:32, skipping insertion in model container [2019-12-26 22:36:32,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:36:32" (1/1) ... [2019-12-26 22:36:32,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:36:32,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:36:33,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:33,454 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:36:33,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:36:33,592 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:36:33,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33 WrapperNode [2019-12-26 22:36:33,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:36:33,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:33,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:36:33,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:36:33,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:36:33,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:36:33,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:36:33,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:36:33,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... [2019-12-26 22:36:33,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:36:33,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:36:33,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:36:33,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:36:33,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:36:33,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:36:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:36:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:36:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:36:33,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:36:33,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:36:33,790 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:36:33,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:36:33,791 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:36:33,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:36:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:36:33,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:36:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:36:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:36:33,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:36:33,795 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:36:34,568 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:36:34,569 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:36:34,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:34 BoogieIcfgContainer [2019-12-26 22:36:34,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:36:34,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:36:34,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:36:34,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:36:34,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:36:32" (1/3) ... [2019-12-26 22:36:34,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e15de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:34, skipping insertion in model container [2019-12-26 22:36:34,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:36:33" (2/3) ... [2019-12-26 22:36:34,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e15de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:36:34, skipping insertion in model container [2019-12-26 22:36:34,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:36:34" (3/3) ... [2019-12-26 22:36:34,579 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-26 22:36:34,589 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:36:34,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:36:34,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:36:34,599 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:36:34,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,641 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,641 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,651 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,651 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,669 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,670 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,671 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,672 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,673 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,677 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,693 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,694 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,694 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,694 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,694 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,695 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,696 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,696 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:36:34,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:36:34,732 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:36:34,733 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:36:34,733 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:36:34,733 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:36:34,733 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:36:34,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:36:34,733 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:36:34,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:36:34,751 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-26 22:36:34,753 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:36:34,882 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:36:34,882 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:34,899 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:36:34,920 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:36:34,970 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:36:34,971 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:36:34,977 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:36:34,993 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:36:34,994 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:36:38,452 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-26 22:36:40,352 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-26 22:36:40,526 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-26 22:36:40,551 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-26 22:36:40,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-26 22:36:40,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-26 22:36:43,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-26 22:36:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-26 22:36:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:36:43,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:43,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:43,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-26 22:36:43,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:43,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23044767] [2019-12-26 22:36:43,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:43,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23044767] [2019-12-26 22:36:43,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:43,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:43,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339154627] [2019-12-26 22:36:43,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:43,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:43,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:43,847 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-26 22:36:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:44,423 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-26 22:36:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:44,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:36:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:44,941 INFO L225 Difference]: With dead ends: 33638 [2019-12-26 22:36:44,941 INFO L226 Difference]: Without dead ends: 32966 [2019-12-26 22:36:44,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-26 22:36:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-26 22:36:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-26 22:36:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-26 22:36:46,740 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-26 22:36:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:46,742 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-26 22:36:46,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-26 22:36:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:36:46,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:46,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:46,759 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-26 22:36:46,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:46,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757287400] [2019-12-26 22:36:46,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:46,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757287400] [2019-12-26 22:36:46,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:46,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:46,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317265077] [2019-12-26 22:36:46,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:46,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:46,944 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-26 22:36:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:49,031 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-26 22:36:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:49,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:36:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:49,266 INFO L225 Difference]: With dead ends: 44494 [2019-12-26 22:36:49,266 INFO L226 Difference]: Without dead ends: 44494 [2019-12-26 22:36:49,267 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-26 22:36:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-26 22:36:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-26 22:36:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-26 22:36:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-26 22:36:51,203 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-26 22:36:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:51,203 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-26 22:36:51,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-26 22:36:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:36:51,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:51,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:51,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-26 22:36:51,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:51,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343100013] [2019-12-26 22:36:51,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:51,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343100013] [2019-12-26 22:36:51,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:51,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300236001] [2019-12-26 22:36:51,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:51,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:51,291 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-26 22:36:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:53,811 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-26 22:36:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:53,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:36:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:54,157 INFO L225 Difference]: With dead ends: 62082 [2019-12-26 22:36:54,158 INFO L226 Difference]: Without dead ends: 62054 [2019-12-26 22:36:54,158 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-26 22:36:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-26 22:36:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-26 22:36:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-26 22:36:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-26 22:36:55,952 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-26 22:36:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:55,952 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-26 22:36:55,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-26 22:36:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:36:56,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:56,316 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] [2019-12-26 22:36:56,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-26 22:36:56,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:56,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815095604] [2019-12-26 22:36:56,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:56,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815095604] [2019-12-26 22:36:56,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:56,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:56,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504609691] [2019-12-26 22:36:56,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:56,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:56,409 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 4 states. [2019-12-26 22:36:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:56,594 INFO L93 Difference]: Finished difference Result 41591 states and 159218 transitions. [2019-12-26 22:36:56,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:36:56,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-26 22:36:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:56,699 INFO L225 Difference]: With dead ends: 41591 [2019-12-26 22:36:56,699 INFO L226 Difference]: Without dead ends: 40483 [2019-12-26 22:36:56,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40483 states. [2019-12-26 22:36:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40483 to 40483. [2019-12-26 22:36:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40483 states. [2019-12-26 22:36:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40483 states to 40483 states and 155742 transitions. [2019-12-26 22:36:59,735 INFO L78 Accepts]: Start accepts. Automaton has 40483 states and 155742 transitions. Word has length 21 [2019-12-26 22:36:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:59,736 INFO L462 AbstractCegarLoop]: Abstraction has 40483 states and 155742 transitions. [2019-12-26 22:36:59,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40483 states and 155742 transitions. [2019-12-26 22:36:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:36:59,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:59,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:59,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:36:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash -656964526, now seen corresponding path program 1 times [2019-12-26 22:36:59,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:59,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118723620] [2019-12-26 22:36:59,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:59,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118723620] [2019-12-26 22:36:59,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:59,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:59,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104368815] [2019-12-26 22:36:59,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:59,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:59,870 INFO L87 Difference]: Start difference. First operand 40483 states and 155742 transitions. Second operand 5 states. [2019-12-26 22:37:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:00,549 INFO L93 Difference]: Finished difference Result 53706 states and 202929 transitions. [2019-12-26 22:37:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:37:00,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:37:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:00,702 INFO L225 Difference]: With dead ends: 53706 [2019-12-26 22:37:00,703 INFO L226 Difference]: Without dead ends: 53685 [2019-12-26 22:37:00,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53685 states. [2019-12-26 22:37:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53685 to 40445. [2019-12-26 22:37:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40445 states. [2019-12-26 22:37:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40445 states to 40445 states and 155392 transitions. [2019-12-26 22:37:02,024 INFO L78 Accepts]: Start accepts. Automaton has 40445 states and 155392 transitions. Word has length 22 [2019-12-26 22:37:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:02,024 INFO L462 AbstractCegarLoop]: Abstraction has 40445 states and 155392 transitions. [2019-12-26 22:37:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40445 states and 155392 transitions. [2019-12-26 22:37:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 22:37:02,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:02,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:02,059 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 342121661, now seen corresponding path program 1 times [2019-12-26 22:37:02,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:02,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710263883] [2019-12-26 22:37:02,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:02,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710263883] [2019-12-26 22:37:02,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:02,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:02,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390216130] [2019-12-26 22:37:02,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:02,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:02,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:02,128 INFO L87 Difference]: Start difference. First operand 40445 states and 155392 transitions. Second operand 3 states. [2019-12-26 22:37:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:03,771 INFO L93 Difference]: Finished difference Result 50324 states and 191154 transitions. [2019-12-26 22:37:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:03,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-26 22:37:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:03,878 INFO L225 Difference]: With dead ends: 50324 [2019-12-26 22:37:03,878 INFO L226 Difference]: Without dead ends: 50324 [2019-12-26 22:37:03,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50324 states. [2019-12-26 22:37:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50324 to 44500. [2019-12-26 22:37:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44500 states. [2019-12-26 22:37:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44500 states to 44500 states and 170418 transitions. [2019-12-26 22:37:05,139 INFO L78 Accepts]: Start accepts. Automaton has 44500 states and 170418 transitions. Word has length 30 [2019-12-26 22:37:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:05,139 INFO L462 AbstractCegarLoop]: Abstraction has 44500 states and 170418 transitions. [2019-12-26 22:37:05,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 44500 states and 170418 transitions. [2019-12-26 22:37:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 22:37:05,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:05,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:05,170 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 125630464, now seen corresponding path program 1 times [2019-12-26 22:37:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:05,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501135965] [2019-12-26 22:37:05,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:05,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501135965] [2019-12-26 22:37:05,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:05,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:05,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885278399] [2019-12-26 22:37:05,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:05,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:05,291 INFO L87 Difference]: Start difference. First operand 44500 states and 170418 transitions. Second operand 6 states. [2019-12-26 22:37:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:05,979 INFO L93 Difference]: Finished difference Result 63217 states and 237355 transitions. [2019-12-26 22:37:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:37:05,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-26 22:37:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:06,123 INFO L225 Difference]: With dead ends: 63217 [2019-12-26 22:37:06,123 INFO L226 Difference]: Without dead ends: 63169 [2019-12-26 22:37:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63169 states. [2019-12-26 22:37:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63169 to 51199. [2019-12-26 22:37:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2019-12-26 22:37:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 194909 transitions. [2019-12-26 22:37:09,342 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 194909 transitions. Word has length 30 [2019-12-26 22:37:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:09,343 INFO L462 AbstractCegarLoop]: Abstraction has 51199 states and 194909 transitions. [2019-12-26 22:37:09,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 194909 transitions. [2019-12-26 22:37:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 22:37:09,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:09,398 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] [2019-12-26 22:37:09,398 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash -334372945, now seen corresponding path program 1 times [2019-12-26 22:37:09,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:09,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560753751] [2019-12-26 22:37:09,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:09,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560753751] [2019-12-26 22:37:09,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:09,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:09,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744084351] [2019-12-26 22:37:09,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:09,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:09,484 INFO L87 Difference]: Start difference. First operand 51199 states and 194909 transitions. Second operand 3 states. [2019-12-26 22:37:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:09,731 INFO L93 Difference]: Finished difference Result 51199 states and 194343 transitions. [2019-12-26 22:37:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:09,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-26 22:37:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:09,841 INFO L225 Difference]: With dead ends: 51199 [2019-12-26 22:37:09,841 INFO L226 Difference]: Without dead ends: 51199 [2019-12-26 22:37:09,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51199 states. [2019-12-26 22:37:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51199 to 51199. [2019-12-26 22:37:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2019-12-26 22:37:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 194343 transitions. [2019-12-26 22:37:11,263 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 194343 transitions. Word has length 36 [2019-12-26 22:37:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 51199 states and 194343 transitions. [2019-12-26 22:37:11,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 194343 transitions. [2019-12-26 22:37:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 22:37:11,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:11,308 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] [2019-12-26 22:37:11,308 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1845178551, now seen corresponding path program 1 times [2019-12-26 22:37:11,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:11,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585720727] [2019-12-26 22:37:11,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:11,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585720727] [2019-12-26 22:37:11,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:11,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:11,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299822719] [2019-12-26 22:37:11,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:11,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:11,489 INFO L87 Difference]: Start difference. First operand 51199 states and 194343 transitions. Second operand 7 states. [2019-12-26 22:37:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:12,580 INFO L93 Difference]: Finished difference Result 69692 states and 259755 transitions. [2019-12-26 22:37:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:37:12,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-26 22:37:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:12,737 INFO L225 Difference]: With dead ends: 69692 [2019-12-26 22:37:12,738 INFO L226 Difference]: Without dead ends: 69612 [2019-12-26 22:37:12,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:37:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69612 states. [2019-12-26 22:37:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69612 to 46252. [2019-12-26 22:37:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-26 22:37:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-26 22:37:16,117 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 36 [2019-12-26 22:37:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:16,117 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-26 22:37:16,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-26 22:37:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 22:37:16,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:16,160 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] [2019-12-26 22:37:16,160 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-26 22:37:16,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:16,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319756103] [2019-12-26 22:37:16,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:16,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319756103] [2019-12-26 22:37:16,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:16,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:16,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580998965] [2019-12-26 22:37:16,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:16,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:16,270 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 6 states. [2019-12-26 22:37:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:16,829 INFO L93 Difference]: Finished difference Result 58248 states and 224178 transitions. [2019-12-26 22:37:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:37:16,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-26 22:37:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:17,518 INFO L225 Difference]: With dead ends: 58248 [2019-12-26 22:37:17,518 INFO L226 Difference]: Without dead ends: 55647 [2019-12-26 22:37:17,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55647 states. [2019-12-26 22:37:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55647 to 51679. [2019-12-26 22:37:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51679 states. [2019-12-26 22:37:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51679 states to 51679 states and 198408 transitions. [2019-12-26 22:37:18,648 INFO L78 Accepts]: Start accepts. Automaton has 51679 states and 198408 transitions. Word has length 36 [2019-12-26 22:37:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:18,649 INFO L462 AbstractCegarLoop]: Abstraction has 51679 states and 198408 transitions. [2019-12-26 22:37:18,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51679 states and 198408 transitions. [2019-12-26 22:37:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 22:37:18,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:18,713 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] [2019-12-26 22:37:18,713 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-26 22:37:18,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:18,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102614735] [2019-12-26 22:37:18,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:18,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102614735] [2019-12-26 22:37:18,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:18,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:18,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766828246] [2019-12-26 22:37:18,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:18,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:18,808 INFO L87 Difference]: Start difference. First operand 51679 states and 198408 transitions. Second operand 5 states. [2019-12-26 22:37:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:18,943 INFO L93 Difference]: Finished difference Result 22140 states and 70370 transitions. [2019-12-26 22:37:18,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:18,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-26 22:37:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:18,976 INFO L225 Difference]: With dead ends: 22140 [2019-12-26 22:37:18,977 INFO L226 Difference]: Without dead ends: 21264 [2019-12-26 22:37:18,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21264 states. [2019-12-26 22:37:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21264 to 21264. [2019-12-26 22:37:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-12-26 22:37:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 67572 transitions. [2019-12-26 22:37:19,926 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 67572 transitions. Word has length 38 [2019-12-26 22:37:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:19,926 INFO L462 AbstractCegarLoop]: Abstraction has 21264 states and 67572 transitions. [2019-12-26 22:37:19,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 67572 transitions. [2019-12-26 22:37:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:19,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:19,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:19,943 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1508152385, now seen corresponding path program 1 times [2019-12-26 22:37:19,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:19,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530117246] [2019-12-26 22:37:19,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:20,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530117246] [2019-12-26 22:37:20,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:20,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:20,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726920225] [2019-12-26 22:37:20,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:20,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:20,091 INFO L87 Difference]: Start difference. First operand 21264 states and 67572 transitions. Second operand 7 states. [2019-12-26 22:37:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:20,508 INFO L93 Difference]: Finished difference Result 36395 states and 116077 transitions. [2019-12-26 22:37:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:37:20,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-26 22:37:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:20,550 INFO L225 Difference]: With dead ends: 36395 [2019-12-26 22:37:20,550 INFO L226 Difference]: Without dead ends: 17493 [2019-12-26 22:37:20,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17493 states. [2019-12-26 22:37:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17493 to 16368. [2019-12-26 22:37:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16368 states. [2019-12-26 22:37:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16368 states to 16368 states and 52247 transitions. [2019-12-26 22:37:20,950 INFO L78 Accepts]: Start accepts. Automaton has 16368 states and 52247 transitions. Word has length 39 [2019-12-26 22:37:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:20,950 INFO L462 AbstractCegarLoop]: Abstraction has 16368 states and 52247 transitions. [2019-12-26 22:37:20,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 16368 states and 52247 transitions. [2019-12-26 22:37:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:37:20,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:20,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:20,967 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2053204377, now seen corresponding path program 2 times [2019-12-26 22:37:20,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:20,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524122485] [2019-12-26 22:37:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:21,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524122485] [2019-12-26 22:37:21,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:21,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:21,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402853382] [2019-12-26 22:37:21,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:21,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:21,117 INFO L87 Difference]: Start difference. First operand 16368 states and 52247 transitions. Second operand 9 states. [2019-12-26 22:37:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:21,590 INFO L93 Difference]: Finished difference Result 23869 states and 76577 transitions. [2019-12-26 22:37:21,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:37:21,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-26 22:37:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:21,630 INFO L225 Difference]: With dead ends: 23869 [2019-12-26 22:37:21,631 INFO L226 Difference]: Without dead ends: 20801 [2019-12-26 22:37:21,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:37:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20801 states. [2019-12-26 22:37:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20801 to 19100. [2019-12-26 22:37:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2019-12-26 22:37:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 60950 transitions. [2019-12-26 22:37:21,948 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 60950 transitions. Word has length 39 [2019-12-26 22:37:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 19100 states and 60950 transitions. [2019-12-26 22:37:21,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 60950 transitions. [2019-12-26 22:37:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:37:21,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:21,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:21,964 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1961307543, now seen corresponding path program 1 times [2019-12-26 22:37:21,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:21,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738077169] [2019-12-26 22:37:21,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:22,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738077169] [2019-12-26 22:37:22,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:22,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:22,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595736523] [2019-12-26 22:37:22,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:22,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:22,094 INFO L87 Difference]: Start difference. First operand 19100 states and 60950 transitions. Second operand 7 states. [2019-12-26 22:37:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:22,400 INFO L93 Difference]: Finished difference Result 33465 states and 106619 transitions. [2019-12-26 22:37:22,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:37:22,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-26 22:37:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:22,446 INFO L225 Difference]: With dead ends: 33465 [2019-12-26 22:37:22,446 INFO L226 Difference]: Without dead ends: 21708 [2019-12-26 22:37:22,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21708 states. [2019-12-26 22:37:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21708 to 19100. [2019-12-26 22:37:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2019-12-26 22:37:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 58738 transitions. [2019-12-26 22:37:23,296 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 58738 transitions. Word has length 40 [2019-12-26 22:37:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:23,296 INFO L462 AbstractCegarLoop]: Abstraction has 19100 states and 58738 transitions. [2019-12-26 22:37:23,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 58738 transitions. [2019-12-26 22:37:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:37:23,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:23,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:23,312 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash -579236051, now seen corresponding path program 2 times [2019-12-26 22:37:23,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:23,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312467038] [2019-12-26 22:37:23,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:23,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312467038] [2019-12-26 22:37:23,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:23,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:37:23,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118847314] [2019-12-26 22:37:23,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:37:23,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:37:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:23,518 INFO L87 Difference]: Start difference. First operand 19100 states and 58738 transitions. Second operand 11 states. [2019-12-26 22:37:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:24,390 INFO L93 Difference]: Finished difference Result 29975 states and 93467 transitions. [2019-12-26 22:37:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:37:24,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-26 22:37:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:24,429 INFO L225 Difference]: With dead ends: 29975 [2019-12-26 22:37:24,429 INFO L226 Difference]: Without dead ends: 26282 [2019-12-26 22:37:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:37:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26282 states. [2019-12-26 22:37:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26282 to 19456. [2019-12-26 22:37:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-26 22:37:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59592 transitions. [2019-12-26 22:37:24,763 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59592 transitions. Word has length 40 [2019-12-26 22:37:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:24,763 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59592 transitions. [2019-12-26 22:37:24,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:37:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59592 transitions. [2019-12-26 22:37:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:37:24,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:24,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:24,777 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 335124460, now seen corresponding path program 1 times [2019-12-26 22:37:24,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:24,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634105917] [2019-12-26 22:37:24,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:24,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634105917] [2019-12-26 22:37:24,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:24,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:24,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097444205] [2019-12-26 22:37:24,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:24,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:24,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:24,861 INFO L87 Difference]: Start difference. First operand 19456 states and 59592 transitions. Second operand 6 states. [2019-12-26 22:37:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:24,939 INFO L93 Difference]: Finished difference Result 3652 states and 8503 transitions. [2019-12-26 22:37:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:37:24,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 22:37:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:24,944 INFO L225 Difference]: With dead ends: 3652 [2019-12-26 22:37:24,945 INFO L226 Difference]: Without dead ends: 3281 [2019-12-26 22:37:24,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2019-12-26 22:37:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3161. [2019-12-26 22:37:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3161 states. [2019-12-26 22:37:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 7202 transitions. [2019-12-26 22:37:24,990 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 7202 transitions. Word has length 40 [2019-12-26 22:37:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 3161 states and 7202 transitions. [2019-12-26 22:37:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:37:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 7202 transitions. [2019-12-26 22:37:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:37:24,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:24,995 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] [2019-12-26 22:37:24,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-26 22:37:24,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:24,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036350422] [2019-12-26 22:37:24,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:25,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036350422] [2019-12-26 22:37:25,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:25,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:25,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822700001] [2019-12-26 22:37:25,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:25,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:25,159 INFO L87 Difference]: Start difference. First operand 3161 states and 7202 transitions. Second operand 7 states. [2019-12-26 22:37:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:25,281 INFO L93 Difference]: Finished difference Result 1228 states and 2842 transitions. [2019-12-26 22:37:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:37:25,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-26 22:37:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:25,284 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:37:25,284 INFO L226 Difference]: Without dead ends: 715 [2019-12-26 22:37:25,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:37:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-26 22:37:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 595. [2019-12-26 22:37:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-12-26 22:37:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1322 transitions. [2019-12-26 22:37:25,299 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1322 transitions. Word has length 48 [2019-12-26 22:37:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:25,299 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 1322 transitions. [2019-12-26 22:37:25,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1322 transitions. [2019-12-26 22:37:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:37:25,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:25,302 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-26 22:37:25,302 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 1 times [2019-12-26 22:37:25,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:25,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254208707] [2019-12-26 22:37:25,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:25,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254208707] [2019-12-26 22:37:25,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:25,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:25,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563337728] [2019-12-26 22:37:25,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:25,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:25,405 INFO L87 Difference]: Start difference. First operand 595 states and 1322 transitions. Second operand 3 states. [2019-12-26 22:37:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:25,421 INFO L93 Difference]: Finished difference Result 572 states and 1242 transitions. [2019-12-26 22:37:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:25,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:37:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:25,422 INFO L225 Difference]: With dead ends: 572 [2019-12-26 22:37:25,423 INFO L226 Difference]: Without dead ends: 572 [2019-12-26 22:37:25,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-26 22:37:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-26 22:37:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-26 22:37:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-26 22:37:25,431 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-26 22:37:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:25,431 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-26 22:37:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-26 22:37:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:25,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:25,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:25,433 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-26 22:37:25,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:25,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311703143] [2019-12-26 22:37:25,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:25,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311703143] [2019-12-26 22:37:25,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:25,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:37:25,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889255511] [2019-12-26 22:37:25,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:37:25,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:37:25,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:37:25,762 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 13 states. [2019-12-26 22:37:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:26,409 INFO L93 Difference]: Finished difference Result 830 states and 1783 transitions. [2019-12-26 22:37:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:37:26,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:37:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:26,411 INFO L225 Difference]: With dead ends: 830 [2019-12-26 22:37:26,411 INFO L226 Difference]: Without dead ends: 794 [2019-12-26 22:37:26,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:37:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-26 22:37:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 776. [2019-12-26 22:37:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-26 22:37:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1695 transitions. [2019-12-26 22:37:26,421 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1695 transitions. Word has length 60 [2019-12-26 22:37:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:26,421 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1695 transitions. [2019-12-26 22:37:26,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:37:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1695 transitions. [2019-12-26 22:37:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:37:26,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:26,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:26,422 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 2 times [2019-12-26 22:37:26,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:26,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283900068] [2019-12-26 22:37:26,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:26,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:37:26,662 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:37:26,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:37:26,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-26 22:37:26,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-26 22:37:26,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-26 22:37:26,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd1~0_Out-1899749234 ~z$r_buff0_thd1~0_In-1899749234) (= ~z$r_buff0_thd3~0_In-1899749234 ~z$r_buff1_thd3~0_Out-1899749234) (= ~a~0_Out-1899749234 1) (= ~__unbuffered_p3_EBX~0_Out-1899749234 ~b~0_In-1899749234) (= ~a~0_Out-1899749234 ~__unbuffered_p3_EAX~0_Out-1899749234) (= ~z$r_buff1_thd2~0_Out-1899749234 ~z$r_buff0_thd2~0_In-1899749234) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1899749234)) (= ~z$r_buff0_thd4~0_Out-1899749234 1) (= ~z$r_buff0_thd0~0_In-1899749234 ~z$r_buff1_thd0~0_Out-1899749234) (= ~z$r_buff1_thd4~0_Out-1899749234 ~z$r_buff0_thd4~0_In-1899749234)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1899749234, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899749234, ~b~0=~b~0_In-1899749234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1899749234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1899749234, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1899749234, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1899749234} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1899749234, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1899749234, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1899749234, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1899749234, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1899749234, ~a~0=~a~0_Out-1899749234, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899749234, ~b~0=~b~0_In-1899749234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1899749234, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1899749234, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1899749234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1899749234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1899749234, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1899749234, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1899749234} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:37:26,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:37:26,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:37:26,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-322309158 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-322309158 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-322309158|)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-322309158| ~z$w_buff0_used~0_In-322309158)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-322309158, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-322309158} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-322309158, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-322309158, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-322309158|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:37:26,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1578172655 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1578172655 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1578172655 |P2Thread1of1ForFork2_#t~ite3_Out1578172655|)) (and (or .cse1 .cse0) (= ~z~0_In1578172655 |P2Thread1of1ForFork2_#t~ite3_Out1578172655|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1578172655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1578172655, ~z$w_buff1~0=~z$w_buff1~0_In1578172655, ~z~0=~z~0_In1578172655} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1578172655|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1578172655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1578172655, ~z$w_buff1~0=~z$w_buff1~0_In1578172655, ~z~0=~z~0_In1578172655} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:37:26,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:37:26,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In553584400 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In553584400 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out553584400| 0)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out553584400| ~z$w_buff0_used~0_In553584400) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In553584400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In553584400} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out553584400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In553584400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In553584400} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:37:26,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1932751930 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1932751930 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1932751930 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1932751930 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1932751930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1932751930| ~z$w_buff1_used~0_In1932751930) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1932751930, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1932751930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1932751930, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1932751930} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1932751930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1932751930, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1932751930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1932751930, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1932751930} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:37:26,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1023763671 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1023763671 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1023763671| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1023763671| ~z$r_buff0_thd3~0_In1023763671)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1023763671, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1023763671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1023763671, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1023763671, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1023763671|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:37:26,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1166039260 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1166039260 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1166039260 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1166039260 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1166039260| 0)) (and (= ~z$r_buff1_thd3~0_In-1166039260 |P2Thread1of1ForFork2_#t~ite8_Out-1166039260|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166039260, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1166039260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166039260, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1166039260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166039260, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1166039260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166039260, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1166039260, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1166039260|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:37:26,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:37:26,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In389116120 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In389116120 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In389116120 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In389116120 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite12_Out389116120| ~z$w_buff1_used~0_In389116120) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out389116120| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In389116120, ~z$w_buff0_used~0=~z$w_buff0_used~0_In389116120, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In389116120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In389116120} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In389116120, ~z$w_buff0_used~0=~z$w_buff0_used~0_In389116120, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In389116120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In389116120, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out389116120|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:37:26,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In642593583 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In642593583 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out642593583 ~z$r_buff0_thd4~0_In642593583)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out642593583)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In642593583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In642593583} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In642593583, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out642593583, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out642593583|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:37:26,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1868994055 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1868994055 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1868994055 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1868994055 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1868994055| ~z$r_buff1_thd4~0_In1868994055)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out1868994055| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1868994055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1868994055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1868994055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1868994055} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1868994055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1868994055, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1868994055|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1868994055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1868994055} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:37:26,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:37:26,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:37:26,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out567334029| |ULTIMATE.start_main_#t~ite20_Out567334029|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In567334029 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In567334029 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite19_Out567334029| ~z~0_In567334029) (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite19_Out567334029| ~z$w_buff1~0_In567334029) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In567334029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In567334029, ~z$w_buff1~0=~z$w_buff1~0_In567334029, ~z~0=~z~0_In567334029} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out567334029|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In567334029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In567334029, ~z$w_buff1~0=~z$w_buff1~0_In567334029, ~z~0=~z~0_In567334029, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out567334029|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:37:26,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2001864819 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2001864819 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-2001864819|)) (and (= ~z$w_buff0_used~0_In-2001864819 |ULTIMATE.start_main_#t~ite21_Out-2001864819|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001864819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001864819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2001864819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2001864819, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2001864819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:37:26,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1950719242 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1950719242 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1950719242 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1950719242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1950719242| 0)) (and (= ~z$w_buff1_used~0_In1950719242 |ULTIMATE.start_main_#t~ite22_Out1950719242|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1950719242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1950719242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1950719242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1950719242} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1950719242, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1950719242, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1950719242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1950719242, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1950719242|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:37:26,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In734245855 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In734245855 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out734245855| ~z$r_buff0_thd0~0_In734245855) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out734245855|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In734245855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In734245855} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In734245855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In734245855, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out734245855|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:37:26,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-27704976 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-27704976 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-27704976 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-27704976 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-27704976|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-27704976 |ULTIMATE.start_main_#t~ite24_Out-27704976|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-27704976, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-27704976, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-27704976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-27704976} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-27704976, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-27704976, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-27704976, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-27704976|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-27704976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:37:26,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2127496689 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2127496689 |ULTIMATE.start_main_#t~ite37_Out-2127496689|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_In-2127496689| |ULTIMATE.start_main_#t~ite36_Out-2127496689|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2127496689 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-2127496689 256)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-2127496689 256) 0)) (and (= (mod ~z$w_buff1_used~0_In-2127496689 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite36_Out-2127496689| ~z$w_buff0_used~0_In-2127496689) (= |ULTIMATE.start_main_#t~ite36_Out-2127496689| |ULTIMATE.start_main_#t~ite37_Out-2127496689|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2127496689, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2127496689, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2127496689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2127496689, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-2127496689|, ~weak$$choice2~0=~weak$$choice2~0_In-2127496689} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2127496689, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2127496689, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2127496689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2127496689, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2127496689|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2127496689|, ~weak$$choice2~0=~weak$$choice2~0_In-2127496689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:37:26,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In503155743 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out503155743| |ULTIMATE.start_main_#t~ite39_Out503155743|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In503155743 256)))) (or (and (= (mod ~z$w_buff1_used~0_In503155743 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In503155743 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In503155743 256))))) .cse1 (= ~z$w_buff1_used~0_In503155743 |ULTIMATE.start_main_#t~ite39_Out503155743|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out503155743| ~z$w_buff1_used~0_In503155743) (= |ULTIMATE.start_main_#t~ite39_In503155743| |ULTIMATE.start_main_#t~ite39_Out503155743|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503155743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503155743, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In503155743|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In503155743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In503155743, ~weak$$choice2~0=~weak$$choice2~0_In503155743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503155743, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out503155743|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out503155743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503155743, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In503155743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In503155743, ~weak$$choice2~0=~weak$$choice2~0_In503155743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:37:26,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:37:26,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:37:26,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:37:26,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:37:26 BasicIcfg [2019-12-26 22:37:26,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:37:26,876 INFO L168 Benchmark]: Toolchain (without parser) took 54034.05 ms. Allocated memory was 145.8 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.0 MB in the beginning and 751.9 MB in the end (delta: -650.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,876 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.71 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.71 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,878 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,879 INFO L168 Benchmark]: RCFGBuilder took 865.31 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,880 INFO L168 Benchmark]: TraceAbstraction took 52301.43 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 100.6 MB in the beginning and 751.9 MB in the end (delta: -651.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:26,883 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.81 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.71 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.71 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.31 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52301.43 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 100.6 MB in the beginning and 751.9 MB in the end (delta: -651.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3024 SDtfs, 3707 SDslu, 9091 SDs, 0 SdLazy, 3122 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51774occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 81668 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 142950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...