/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/mix056_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:59:33,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:59:33,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:59:33,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:59:33,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:59:33,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:59:33,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:59:33,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:59:33,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:59:33,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:59:33,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:59:33,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:59:33,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:59:33,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:59:33,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:59:33,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:59:33,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:59:33,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:59:33,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:59:33,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:59:33,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:59:33,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:59:33,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:59:33,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:59:33,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:59:33,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:59:33,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:59:33,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:59:33,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:59:33,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:59:33,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:59:33,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:59:33,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:59:33,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:59:33,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:59:33,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:59:33,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:59:33,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:59:33,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:59:33,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:59:33,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:59:33,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:59:33,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:59:33,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:59:33,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:59:33,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:59:33,662 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:59:33,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:59:33,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:59:33,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:59:33,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:59:33,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:59:33,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:59:33,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:59:33,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:59:33,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:59:33,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:59:33,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:59:33,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:59:33,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:59:33,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:59:33,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:59:33,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:59:33,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:33,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:59:33,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:59:33,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:59:33,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:59:33,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:59:33,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:59:33,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:59:33,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:59:33,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:59:33,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:59:33,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:59:33,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:59:33,999 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:59:33,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-18 13:59:34,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ac167cb/80f73ef455fc461385ad9d3403bf23e0/FLAGb96427beb [2019-12-18 13:59:34,597 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:59:34,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-18 13:59:34,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ac167cb/80f73ef455fc461385ad9d3403bf23e0/FLAGb96427beb [2019-12-18 13:59:34,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ac167cb/80f73ef455fc461385ad9d3403bf23e0 [2019-12-18 13:59:34,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:59:34,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:59:34,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:34,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:59:34,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:59:34,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:34" (1/1) ... [2019-12-18 13:59:34,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfebce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:34, skipping insertion in model container [2019-12-18 13:59:34,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:34" (1/1) ... [2019-12-18 13:59:34,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:59:34,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:59:35,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:35,485 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:59:35,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:35,710 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:59:35,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35 WrapperNode [2019-12-18 13:59:35,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:35,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:35,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:59:35,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:59:35,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:35,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:59:35,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:59:35,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:59:35,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... [2019-12-18 13:59:35,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:59:35,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:59:35,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:59:35,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:59:35,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:59:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:59:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:59:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:59:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:59:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:59:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:59:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:59:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:59:35,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:59:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:59:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:59:35,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:59:35,908 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:59:36,696 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:59:36,697 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:59:36,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:36 BoogieIcfgContainer [2019-12-18 13:59:36,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:59:36,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:59:36,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:59:36,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:59:36,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:59:34" (1/3) ... [2019-12-18 13:59:36,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275d43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:36, skipping insertion in model container [2019-12-18 13:59:36,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:35" (2/3) ... [2019-12-18 13:59:36,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275d43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:36, skipping insertion in model container [2019-12-18 13:59:36,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:36" (3/3) ... [2019-12-18 13:59:36,707 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.oepc.i [2019-12-18 13:59:36,718 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:59:36,718 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:59:36,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:59:36,727 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:59:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,821 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,880 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:36,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:59:36,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:59:36,928 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:59:36,928 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:59:36,928 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:59:36,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:59:36,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:59:36,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:59:36,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:59:36,950 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 13:59:36,952 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:37,049 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:37,050 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:37,069 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:37,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:37,177 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:37,178 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:37,189 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:37,216 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:59:37,217 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:59:43,179 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 13:59:43,309 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 13:59:43,328 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-18 13:59:43,329 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 13:59:43,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:59:58,319 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:59:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:59:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:59:58,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:58,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:59:58,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-18 13:59:58,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:58,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359143586] [2019-12-18 13:59:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:59:58,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359143586] [2019-12-18 13:59:58,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:58,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:59:58,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767860923] [2019-12-18 13:59:58,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:58,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:58,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:58,615 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 14:00:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:02,038 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-18 14:00:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:02,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:00:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:02,710 INFO L225 Difference]: With dead ends: 101472 [2019-12-18 14:00:02,710 INFO L226 Difference]: Without dead ends: 95232 [2019-12-18 14:00:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-18 14:00:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-18 14:00:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-18 14:00:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-18 14:00:12,330 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-18 14:00:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:12,330 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-18 14:00:12,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-18 14:00:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:00:12,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:12,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:12,337 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-18 14:00:12,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:12,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390072356] [2019-12-18 14:00:12,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:12,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390072356] [2019-12-18 14:00:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400452963] [2019-12-18 14:00:12,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:12,435 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-18 14:00:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:17,431 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-18 14:00:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:17,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:00:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,962 INFO L225 Difference]: With dead ends: 151692 [2019-12-18 14:00:17,962 INFO L226 Difference]: Without dead ends: 151643 [2019-12-18 14:00:17,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-18 14:00:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-18 14:00:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-18 14:00:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-18 14:00:25,801 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-18 14:00:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:25,802 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-18 14:00:25,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-18 14:00:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:25,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:25,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:25,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-18 14:00:25,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:25,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736594877] [2019-12-18 14:00:25,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:25,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736594877] [2019-12-18 14:00:25,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:25,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:25,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144623987] [2019-12-18 14:00:25,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:25,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:25,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:25,903 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-18 14:00:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:26,023 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-18 14:00:26,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:26,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:00:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:26,126 INFO L225 Difference]: With dead ends: 30955 [2019-12-18 14:00:26,126 INFO L226 Difference]: Without dead ends: 30955 [2019-12-18 14:00:26,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-18 14:00:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-18 14:00:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-18 14:00:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-18 14:00:31,139 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-18 14:00:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:31,140 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-18 14:00:31,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-18 14:00:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:31,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:31,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:31,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-18 14:00:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588809613] [2019-12-18 14:00:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:31,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588809613] [2019-12-18 14:00:31,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:31,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:31,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767184917] [2019-12-18 14:00:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:31,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:31,222 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-18 14:00:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:31,415 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-18 14:00:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:31,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:00:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:31,511 INFO L225 Difference]: With dead ends: 47061 [2019-12-18 14:00:31,512 INFO L226 Difference]: Without dead ends: 47061 [2019-12-18 14:00:31,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-18 14:00:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-18 14:00:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-18 14:00:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-18 14:00:32,483 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-18 14:00:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:32,484 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-18 14:00:32,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-18 14:00:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:32,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:32,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:32,487 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-18 14:00:32,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:32,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121072725] [2019-12-18 14:00:32,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:32,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121072725] [2019-12-18 14:00:32,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:32,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:32,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480451557] [2019-12-18 14:00:32,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:32,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:32,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:32,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:32,596 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-18 14:00:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:32,982 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-18 14:00:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:32,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:33,049 INFO L225 Difference]: With dead ends: 41000 [2019-12-18 14:00:33,049 INFO L226 Difference]: Without dead ends: 41000 [2019-12-18 14:00:33,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-18 14:00:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-18 14:00:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-18 14:00:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-18 14:00:34,169 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-18 14:00:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:34,169 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-18 14:00:34,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-18 14:00:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:34,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:34,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:34,172 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:34,172 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-18 14:00:34,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:34,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932998383] [2019-12-18 14:00:34,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:34,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932998383] [2019-12-18 14:00:34,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:34,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:34,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713765164] [2019-12-18 14:00:34,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:34,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:34,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:34,237 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-18 14:00:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:34,566 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-18 14:00:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:34,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:34,641 INFO L225 Difference]: With dead ends: 45062 [2019-12-18 14:00:34,641 INFO L226 Difference]: Without dead ends: 45062 [2019-12-18 14:00:34,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-18 14:00:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-18 14:00:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-18 14:00:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-18 14:00:35,337 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-18 14:00:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:35,338 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-18 14:00:35,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-18 14:00:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:35,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:35,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:35,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-18 14:00:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:35,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543721501] [2019-12-18 14:00:35,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:35,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-18 14:00:35,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543721501] [2019-12-18 14:00:35,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:35,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:35,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070235529] [2019-12-18 14:00:35,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:35,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:35,486 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-18 14:00:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,421 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-18 14:00:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:36,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,513 INFO L225 Difference]: With dead ends: 53898 [2019-12-18 14:00:36,513 INFO L226 Difference]: Without dead ends: 53891 [2019-12-18 14:00:36,513 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-18 14:00:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-18 14:00:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-18 14:00:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-18 14:00:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-18 14:00:37,277 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-18 14:00:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:37,278 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-18 14:00:37,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-18 14:00:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:37,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:37,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:37,287 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-18 14:00:37,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:37,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932881708] [2019-12-18 14:00:37,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:37,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932881708] [2019-12-18 14:00:37,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:37,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:37,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681701520] [2019-12-18 14:00:37,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:37,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:37,357 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-18 14:00:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:38,367 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-18 14:00:38,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:38,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:38,463 INFO L225 Difference]: With dead ends: 56181 [2019-12-18 14:00:38,463 INFO L226 Difference]: Without dead ends: 56174 [2019-12-18 14:00:38,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-18 14:00:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-18 14:00:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-18 14:00:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-18 14:00:39,213 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-18 14:00:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:39,213 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-18 14:00:39,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-18 14:00:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:00:39,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:39,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:39,226 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-18 14:00:39,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:39,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645159338] [2019-12-18 14:00:39,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:39,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645159338] [2019-12-18 14:00:39,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:39,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:39,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870946577] [2019-12-18 14:00:39,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:39,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:39,267 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-18 14:00:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:39,352 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-18 14:00:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:00:39,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:00:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:39,386 INFO L225 Difference]: With dead ends: 15260 [2019-12-18 14:00:39,386 INFO L226 Difference]: Without dead ends: 15260 [2019-12-18 14:00:39,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-18 14:00:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-18 14:00:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-18 14:00:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-18 14:00:39,740 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-18 14:00:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:39,740 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-18 14:00:39,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-18 14:00:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:00:39,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:39,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:39,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:39,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-18 14:00:39,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:39,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760084570] [2019-12-18 14:00:39,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:39,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760084570] [2019-12-18 14:00:39,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:39,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:39,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340232872] [2019-12-18 14:00:39,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:39,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:39,841 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-18 14:00:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:40,400 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-18 14:00:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:40,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:00:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:40,444 INFO L225 Difference]: With dead ends: 19496 [2019-12-18 14:00:40,444 INFO L226 Difference]: Without dead ends: 19496 [2019-12-18 14:00:40,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-18 14:00:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-18 14:00:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-18 14:00:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-18 14:00:40,825 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-18 14:00:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:40,825 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-18 14:00:40,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-18 14:00:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:00:40,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:40,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:40,838 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-18 14:00:40,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:40,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119522289] [2019-12-18 14:00:40,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:40,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119522289] [2019-12-18 14:00:40,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:40,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:40,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199582561] [2019-12-18 14:00:40,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:40,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:40,906 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-18 14:00:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:41,286 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-18 14:00:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:41,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:00:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:41,316 INFO L225 Difference]: With dead ends: 21384 [2019-12-18 14:00:41,316 INFO L226 Difference]: Without dead ends: 21384 [2019-12-18 14:00:41,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-18 14:00:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-18 14:00:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-18 14:00:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-18 14:00:41,587 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-18 14:00:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:41,587 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-18 14:00:41,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-18 14:00:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:00:41,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:41,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:41,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-18 14:00:41,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:41,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491855705] [2019-12-18 14:00:41,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:41,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491855705] [2019-12-18 14:00:41,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:41,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:41,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966085180] [2019-12-18 14:00:41,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:41,726 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 7 states. [2019-12-18 14:00:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:42,645 INFO L93 Difference]: Finished difference Result 25126 states and 74494 transitions. [2019-12-18 14:00:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:00:42,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:00:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:42,680 INFO L225 Difference]: With dead ends: 25126 [2019-12-18 14:00:42,681 INFO L226 Difference]: Without dead ends: 25126 [2019-12-18 14:00:42,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:00:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25126 states. [2019-12-18 14:00:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25126 to 18107. [2019-12-18 14:00:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18107 states. [2019-12-18 14:00:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 55159 transitions. [2019-12-18 14:00:43,216 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 55159 transitions. Word has length 33 [2019-12-18 14:00:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:43,217 INFO L462 AbstractCegarLoop]: Abstraction has 18107 states and 55159 transitions. [2019-12-18 14:00:43,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 55159 transitions. [2019-12-18 14:00:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:00:43,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:43,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:43,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1137221687, now seen corresponding path program 2 times [2019-12-18 14:00:43,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:43,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209162892] [2019-12-18 14:00:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:43,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209162892] [2019-12-18 14:00:43,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:43,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:43,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246119471] [2019-12-18 14:00:43,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:43,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:43,315 INFO L87 Difference]: Start difference. First operand 18107 states and 55159 transitions. Second operand 6 states. [2019-12-18 14:00:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:43,960 INFO L93 Difference]: Finished difference Result 22885 states and 68158 transitions. [2019-12-18 14:00:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:43,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 14:00:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:43,991 INFO L225 Difference]: With dead ends: 22885 [2019-12-18 14:00:43,991 INFO L226 Difference]: Without dead ends: 22885 [2019-12-18 14:00:43,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2019-12-18 14:00:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 18692. [2019-12-18 14:00:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-18 14:00:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-18 14:00:44,289 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-18 14:00:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:44,290 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-18 14:00:44,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-18 14:00:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 14:00:44,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:44,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:44,309 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-18 14:00:44,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:44,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578153767] [2019-12-18 14:00:44,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:44,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578153767] [2019-12-18 14:00:44,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:44,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:44,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330597098] [2019-12-18 14:00:44,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:44,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:44,419 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-18 14:00:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:45,121 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-18 14:00:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:45,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 14:00:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:45,153 INFO L225 Difference]: With dead ends: 23844 [2019-12-18 14:00:45,154 INFO L226 Difference]: Without dead ends: 23844 [2019-12-18 14:00:45,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-18 14:00:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-18 14:00:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-18 14:00:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-18 14:00:45,431 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-18 14:00:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:45,432 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-18 14:00:45,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-18 14:00:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:00:45,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:45,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:45,448 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-18 14:00:45,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:45,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697884403] [2019-12-18 14:00:45,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:45,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697884403] [2019-12-18 14:00:45,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:45,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:45,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475889336] [2019-12-18 14:00:45,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:45,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:45,495 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-18 14:00:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:45,615 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-18 14:00:45,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:45,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:00:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:45,647 INFO L225 Difference]: With dead ends: 29593 [2019-12-18 14:00:45,647 INFO L226 Difference]: Without dead ends: 16129 [2019-12-18 14:00:45,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-18 14:00:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-18 14:00:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 14:00:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-18 14:00:46,276 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-18 14:00:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:46,276 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-18 14:00:46,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-18 14:00:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:46,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:46,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:46,300 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-18 14:00:46,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:46,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79665619] [2019-12-18 14:00:46,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:46,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79665619] [2019-12-18 14:00:46,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:46,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:46,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637687057] [2019-12-18 14:00:46,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:46,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:46,372 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-18 14:00:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:46,930 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-18 14:00:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:46,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:46,963 INFO L225 Difference]: With dead ends: 23632 [2019-12-18 14:00:46,963 INFO L226 Difference]: Without dead ends: 23632 [2019-12-18 14:00:46,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-18 14:00:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-18 14:00:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-18 14:00:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-18 14:00:47,291 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-18 14:00:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:47,291 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-18 14:00:47,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-18 14:00:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:47,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:47,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:47,322 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-18 14:00:47,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:47,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870498437] [2019-12-18 14:00:47,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:47,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870498437] [2019-12-18 14:00:47,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:47,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:47,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584008318] [2019-12-18 14:00:47,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:47,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:47,394 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-18 14:00:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:47,511 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-18 14:00:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:47,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:47,557 INFO L225 Difference]: With dead ends: 20526 [2019-12-18 14:00:47,557 INFO L226 Difference]: Without dead ends: 18967 [2019-12-18 14:00:47,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-18 14:00:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-18 14:00:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-18 14:00:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-18 14:00:48,105 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-18 14:00:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:48,106 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-18 14:00:48,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-18 14:00:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:48,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:48,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:48,145 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-18 14:00:48,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:48,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924220587] [2019-12-18 14:00:48,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:48,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924220587] [2019-12-18 14:00:48,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:48,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:48,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969209722] [2019-12-18 14:00:48,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:48,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:48,210 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-18 14:00:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:48,351 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-18 14:00:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:48,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:00:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:48,393 INFO L225 Difference]: With dead ends: 24294 [2019-12-18 14:00:48,394 INFO L226 Difference]: Without dead ends: 24294 [2019-12-18 14:00:48,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-18 14:00:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-18 14:00:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-18 14:00:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-18 14:00:49,025 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-18 14:00:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:49,025 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-18 14:00:49,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-18 14:00:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:49,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:49,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:49,053 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-18 14:00:49,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:49,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860808925] [2019-12-18 14:00:49,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:49,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860808925] [2019-12-18 14:00:49,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:49,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:00:49,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737901971] [2019-12-18 14:00:49,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:00:49,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:00:49,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:00:49,154 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-18 14:00:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:50,352 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-18 14:00:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:00:50,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 14:00:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:50,471 INFO L225 Difference]: With dead ends: 80145 [2019-12-18 14:00:50,472 INFO L226 Difference]: Without dead ends: 58918 [2019-12-18 14:00:50,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:00:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-18 14:00:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-18 14:00:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-18 14:00:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-18 14:00:51,094 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-18 14:00:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:51,095 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-18 14:00:51,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:00:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-18 14:00:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:51,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:51,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:51,119 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-18 14:00:51,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:51,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588818941] [2019-12-18 14:00:51,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588818941] [2019-12-18 14:00:51,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:51,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935813648] [2019-12-18 14:00:51,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:51,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:51,193 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-18 14:00:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:51,954 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-18 14:00:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:51,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:00:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:52,012 INFO L225 Difference]: With dead ends: 60723 [2019-12-18 14:00:52,013 INFO L226 Difference]: Without dead ends: 42175 [2019-12-18 14:00:52,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:00:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-18 14:00:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-18 14:00:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-18 14:00:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-18 14:00:52,492 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-18 14:00:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:52,493 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-18 14:00:52,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-18 14:00:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:52,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:52,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:52,517 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-18 14:00:52,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:52,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336264404] [2019-12-18 14:00:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:52,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336264404] [2019-12-18 14:00:52,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:52,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:52,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520357121] [2019-12-18 14:00:52,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:52,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:52,628 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-18 14:00:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:53,979 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-18 14:00:53,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:00:53,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:00:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:54,092 INFO L225 Difference]: With dead ends: 82000 [2019-12-18 14:00:54,092 INFO L226 Difference]: Without dead ends: 78263 [2019-12-18 14:00:54,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:00:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-18 14:00:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-18 14:00:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-18 14:00:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-18 14:00:55,217 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-18 14:00:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:55,217 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-18 14:00:55,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:00:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-18 14:00:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:55,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:55,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:55,249 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-18 14:00:55,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:55,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042055782] [2019-12-18 14:00:55,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:55,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042055782] [2019-12-18 14:00:55,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:55,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:55,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817653303] [2019-12-18 14:00:55,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:55,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:55,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:55,369 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-18 14:00:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:56,724 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-18 14:00:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:00:56,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:00:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:56,863 INFO L225 Difference]: With dead ends: 98855 [2019-12-18 14:00:56,863 INFO L226 Difference]: Without dead ends: 95231 [2019-12-18 14:00:56,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:00:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-18 14:00:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-18 14:00:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-18 14:00:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-18 14:00:58,232 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-18 14:00:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:58,233 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-18 14:00:58,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:00:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-18 14:00:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:58,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:58,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:58,263 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-18 14:00:58,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:58,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321459186] [2019-12-18 14:00:58,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:58,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321459186] [2019-12-18 14:00:58,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:58,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:58,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562613117] [2019-12-18 14:00:58,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:58,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:58,332 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-18 14:00:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:58,930 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-18 14:00:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:00:58,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:00:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:59,043 INFO L225 Difference]: With dead ends: 51563 [2019-12-18 14:00:59,043 INFO L226 Difference]: Without dead ends: 44912 [2019-12-18 14:00:59,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-18 14:00:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-18 14:00:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-18 14:01:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-18 14:01:00,013 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-18 14:01:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:00,014 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-18 14:01:00,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:01:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-18 14:01:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:01:00,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:00,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:00,054 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-18 14:01:00,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:00,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369024303] [2019-12-18 14:01:00,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:00,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-18 14:01:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369024303] [2019-12-18 14:01:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:00,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582477308] [2019-12-18 14:01:00,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:00,116 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 3 states. [2019-12-18 14:01:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:00,284 INFO L93 Difference]: Finished difference Result 30036 states and 90273 transitions. [2019-12-18 14:01:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:00,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:01:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:00,340 INFO L225 Difference]: With dead ends: 30036 [2019-12-18 14:01:00,340 INFO L226 Difference]: Without dead ends: 30036 [2019-12-18 14:01:00,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-18 14:01:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 25720. [2019-12-18 14:01:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25720 states. [2019-12-18 14:01:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25720 states to 25720 states and 77719 transitions. [2019-12-18 14:01:01,137 INFO L78 Accepts]: Start accepts. Automaton has 25720 states and 77719 transitions. Word has length 64 [2019-12-18 14:01:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:01,138 INFO L462 AbstractCegarLoop]: Abstraction has 25720 states and 77719 transitions. [2019-12-18 14:01:01,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 25720 states and 77719 transitions. [2019-12-18 14:01:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:01,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:01,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:01,190 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash 649944659, now seen corresponding path program 1 times [2019-12-18 14:01:01,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:01,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149576416] [2019-12-18 14:01:01,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:01,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149576416] [2019-12-18 14:01:01,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:01,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:01:01,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451930255] [2019-12-18 14:01:01,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:01:01,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:01:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:01:01,351 INFO L87 Difference]: Start difference. First operand 25720 states and 77719 transitions. Second operand 8 states. [2019-12-18 14:01:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:02,582 INFO L93 Difference]: Finished difference Result 68691 states and 204481 transitions. [2019-12-18 14:01:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:01:02,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 14:01:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:02,673 INFO L225 Difference]: With dead ends: 68691 [2019-12-18 14:01:02,673 INFO L226 Difference]: Without dead ends: 64109 [2019-12-18 14:01:02,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:01:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64109 states. [2019-12-18 14:01:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64109 to 25809. [2019-12-18 14:01:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25809 states. [2019-12-18 14:01:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25809 states to 25809 states and 78069 transitions. [2019-12-18 14:01:03,359 INFO L78 Accepts]: Start accepts. Automaton has 25809 states and 78069 transitions. Word has length 65 [2019-12-18 14:01:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:03,359 INFO L462 AbstractCegarLoop]: Abstraction has 25809 states and 78069 transitions. [2019-12-18 14:01:03,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:01:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 25809 states and 78069 transitions. [2019-12-18 14:01:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:03,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:03,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:03,387 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash -824760731, now seen corresponding path program 2 times [2019-12-18 14:01:03,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:03,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767013097] [2019-12-18 14:01:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:03,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767013097] [2019-12-18 14:01:03,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:03,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:03,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878605885] [2019-12-18 14:01:03,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:03,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:03,516 INFO L87 Difference]: Start difference. First operand 25809 states and 78069 transitions. Second operand 9 states. [2019-12-18 14:01:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:04,844 INFO L93 Difference]: Finished difference Result 79915 states and 236179 transitions. [2019-12-18 14:01:04,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:01:04,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:01:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:04,938 INFO L225 Difference]: With dead ends: 79915 [2019-12-18 14:01:04,939 INFO L226 Difference]: Without dead ends: 75333 [2019-12-18 14:01:04,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:01:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75333 states. [2019-12-18 14:01:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75333 to 25817. [2019-12-18 14:01:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25817 states. [2019-12-18 14:01:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25817 states to 25817 states and 78084 transitions. [2019-12-18 14:01:06,020 INFO L78 Accepts]: Start accepts. Automaton has 25817 states and 78084 transitions. Word has length 65 [2019-12-18 14:01:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:06,020 INFO L462 AbstractCegarLoop]: Abstraction has 25817 states and 78084 transitions. [2019-12-18 14:01:06,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 25817 states and 78084 transitions. [2019-12-18 14:01:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:06,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:06,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:06,048 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1258547867, now seen corresponding path program 3 times [2019-12-18 14:01:06,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:06,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534953487] [2019-12-18 14:01:06,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:06,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534953487] [2019-12-18 14:01:06,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:06,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:06,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421775568] [2019-12-18 14:01:06,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:06,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:06,182 INFO L87 Difference]: Start difference. First operand 25817 states and 78084 transitions. Second operand 9 states. [2019-12-18 14:01:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:07,498 INFO L93 Difference]: Finished difference Result 88714 states and 261426 transitions. [2019-12-18 14:01:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:01:07,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:01:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:07,620 INFO L225 Difference]: With dead ends: 88714 [2019-12-18 14:01:07,620 INFO L226 Difference]: Without dead ends: 84158 [2019-12-18 14:01:07,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:01:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84158 states. [2019-12-18 14:01:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84158 to 25729. [2019-12-18 14:01:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25729 states. [2019-12-18 14:01:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25729 states to 25729 states and 77660 transitions. [2019-12-18 14:01:08,396 INFO L78 Accepts]: Start accepts. Automaton has 25729 states and 77660 transitions. Word has length 65 [2019-12-18 14:01:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:08,397 INFO L462 AbstractCegarLoop]: Abstraction has 25729 states and 77660 transitions. [2019-12-18 14:01:08,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25729 states and 77660 transitions. [2019-12-18 14:01:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:08,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:08,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, 1, 1, 1, 1, 1] [2019-12-18 14:01:08,422 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:08,422 INFO L82 PathProgramCache]: Analyzing trace with hash -374970767, now seen corresponding path program 4 times [2019-12-18 14:01:08,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:08,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929864299] [2019-12-18 14:01:08,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:08,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929864299] [2019-12-18 14:01:08,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:08,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:01:08,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450890610] [2019-12-18 14:01:08,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:01:08,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:01:08,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:01:08,489 INFO L87 Difference]: Start difference. First operand 25729 states and 77660 transitions. Second operand 4 states. [2019-12-18 14:01:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:08,928 INFO L93 Difference]: Finished difference Result 25729 states and 77465 transitions. [2019-12-18 14:01:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:01:08,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:01:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:08,964 INFO L225 Difference]: With dead ends: 25729 [2019-12-18 14:01:08,964 INFO L226 Difference]: Without dead ends: 25729 [2019-12-18 14:01:08,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:01:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25729 states. [2019-12-18 14:01:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25729 to 24043. [2019-12-18 14:01:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24043 states. [2019-12-18 14:01:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24043 states to 24043 states and 72396 transitions. [2019-12-18 14:01:09,327 INFO L78 Accepts]: Start accepts. Automaton has 24043 states and 72396 transitions. Word has length 65 [2019-12-18 14:01:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:09,328 INFO L462 AbstractCegarLoop]: Abstraction has 24043 states and 72396 transitions. [2019-12-18 14:01:09,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:01:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24043 states and 72396 transitions. [2019-12-18 14:01:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:09,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:09,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:09,351 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash -704047196, now seen corresponding path program 1 times [2019-12-18 14:01:09,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:09,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156142088] [2019-12-18 14:01:09,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:09,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156142088] [2019-12-18 14:01:09,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:09,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:01:09,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771353619] [2019-12-18 14:01:09,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:09,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:09,497 INFO L87 Difference]: Start difference. First operand 24043 states and 72396 transitions. Second operand 9 states. [2019-12-18 14:01:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:11,865 INFO L93 Difference]: Finished difference Result 47294 states and 137988 transitions. [2019-12-18 14:01:11,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:01:11,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 14:01:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:11,932 INFO L225 Difference]: With dead ends: 47294 [2019-12-18 14:01:11,932 INFO L226 Difference]: Without dead ends: 46963 [2019-12-18 14:01:11,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:01:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46963 states. [2019-12-18 14:01:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46963 to 27549. [2019-12-18 14:01:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27549 states. [2019-12-18 14:01:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27549 states to 27549 states and 82492 transitions. [2019-12-18 14:01:12,514 INFO L78 Accepts]: Start accepts. Automaton has 27549 states and 82492 transitions. Word has length 65 [2019-12-18 14:01:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:12,515 INFO L462 AbstractCegarLoop]: Abstraction has 27549 states and 82492 transitions. [2019-12-18 14:01:12,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27549 states and 82492 transitions. [2019-12-18 14:01:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:01:12,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:12,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:12,546 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash 720231034, now seen corresponding path program 2 times [2019-12-18 14:01:12,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:12,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218749752] [2019-12-18 14:01:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:12,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218749752] [2019-12-18 14:01:12,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:12,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:12,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412209607] [2019-12-18 14:01:12,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:12,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:12,606 INFO L87 Difference]: Start difference. First operand 27549 states and 82492 transitions. Second operand 3 states. [2019-12-18 14:01:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:12,721 INFO L93 Difference]: Finished difference Result 27549 states and 82491 transitions. [2019-12-18 14:01:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:12,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:01:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:12,772 INFO L225 Difference]: With dead ends: 27549 [2019-12-18 14:01:12,772 INFO L226 Difference]: Without dead ends: 27549 [2019-12-18 14:01:12,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27549 states. [2019-12-18 14:01:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27549 to 21284. [2019-12-18 14:01:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21284 states. [2019-12-18 14:01:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21284 states to 21284 states and 64952 transitions. [2019-12-18 14:01:13,417 INFO L78 Accepts]: Start accepts. Automaton has 21284 states and 64952 transitions. Word has length 65 [2019-12-18 14:01:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:13,417 INFO L462 AbstractCegarLoop]: Abstraction has 21284 states and 64952 transitions. [2019-12-18 14:01:13,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 21284 states and 64952 transitions. [2019-12-18 14:01:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:01:13,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:13,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:13,438 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1061804981, now seen corresponding path program 1 times [2019-12-18 14:01:13,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:13,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939842366] [2019-12-18 14:01:13,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939842366] [2019-12-18 14:01:13,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:13,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:01:13,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133813029] [2019-12-18 14:01:13,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:01:13,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:01:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:13,497 INFO L87 Difference]: Start difference. First operand 21284 states and 64952 transitions. Second operand 3 states. [2019-12-18 14:01:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:13,571 INFO L93 Difference]: Finished difference Result 17967 states and 53852 transitions. [2019-12-18 14:01:13,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:01:13,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:01:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:13,601 INFO L225 Difference]: With dead ends: 17967 [2019-12-18 14:01:13,602 INFO L226 Difference]: Without dead ends: 17967 [2019-12-18 14:01:13,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:01:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17967 states. [2019-12-18 14:01:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17967 to 16929. [2019-12-18 14:01:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16929 states. [2019-12-18 14:01:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16929 states to 16929 states and 50697 transitions. [2019-12-18 14:01:13,856 INFO L78 Accepts]: Start accepts. Automaton has 16929 states and 50697 transitions. Word has length 66 [2019-12-18 14:01:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:13,856 INFO L462 AbstractCegarLoop]: Abstraction has 16929 states and 50697 transitions. [2019-12-18 14:01:13,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:01:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16929 states and 50697 transitions. [2019-12-18 14:01:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:13,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:13,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:13,875 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28997027, now seen corresponding path program 1 times [2019-12-18 14:01:13,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:13,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544067043] [2019-12-18 14:01:13,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:14,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544067043] [2019-12-18 14:01:14,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:14,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:01:14,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058327869] [2019-12-18 14:01:14,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:01:14,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:01:14,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:01:14,390 INFO L87 Difference]: Start difference. First operand 16929 states and 50697 transitions. Second operand 15 states. [2019-12-18 14:01:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:18,733 INFO L93 Difference]: Finished difference Result 30284 states and 89517 transitions. [2019-12-18 14:01:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:01:18,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 14:01:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:18,767 INFO L225 Difference]: With dead ends: 30284 [2019-12-18 14:01:18,767 INFO L226 Difference]: Without dead ends: 24637 [2019-12-18 14:01:18,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:01:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24637 states. [2019-12-18 14:01:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24637 to 17767. [2019-12-18 14:01:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17767 states. [2019-12-18 14:01:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17767 states to 17767 states and 52817 transitions. [2019-12-18 14:01:19,300 INFO L78 Accepts]: Start accepts. Automaton has 17767 states and 52817 transitions. Word has length 67 [2019-12-18 14:01:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:19,300 INFO L462 AbstractCegarLoop]: Abstraction has 17767 states and 52817 transitions. [2019-12-18 14:01:19,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:01:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 17767 states and 52817 transitions. [2019-12-18 14:01:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:19,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:19,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:19,319 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1388361059, now seen corresponding path program 2 times [2019-12-18 14:01:19,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:19,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931342733] [2019-12-18 14:01:19,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:19,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931342733] [2019-12-18 14:01:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:19,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:01:19,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868814595] [2019-12-18 14:01:19,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:01:19,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:01:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:01:19,510 INFO L87 Difference]: Start difference. First operand 17767 states and 52817 transitions. Second operand 12 states. [2019-12-18 14:01:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:20,794 INFO L93 Difference]: Finished difference Result 38770 states and 115044 transitions. [2019-12-18 14:01:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:01:20,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 14:01:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:20,859 INFO L225 Difference]: With dead ends: 38770 [2019-12-18 14:01:20,859 INFO L226 Difference]: Without dead ends: 36855 [2019-12-18 14:01:20,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 14:01:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36855 states. [2019-12-18 14:01:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36855 to 20848. [2019-12-18 14:01:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20848 states. [2019-12-18 14:01:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20848 states to 20848 states and 62110 transitions. [2019-12-18 14:01:21,296 INFO L78 Accepts]: Start accepts. Automaton has 20848 states and 62110 transitions. Word has length 67 [2019-12-18 14:01:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:21,296 INFO L462 AbstractCegarLoop]: Abstraction has 20848 states and 62110 transitions. [2019-12-18 14:01:21,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:01:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 20848 states and 62110 transitions. [2019-12-18 14:01:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:21,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:21,316 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash -899417817, now seen corresponding path program 3 times [2019-12-18 14:01:21,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:21,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49060896] [2019-12-18 14:01:21,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:21,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49060896] [2019-12-18 14:01:21,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:21,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:01:21,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807316964] [2019-12-18 14:01:21,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:01:21,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:01:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:01:21,470 INFO L87 Difference]: Start difference. First operand 20848 states and 62110 transitions. Second operand 12 states. [2019-12-18 14:01:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:22,561 INFO L93 Difference]: Finished difference Result 37597 states and 110874 transitions. [2019-12-18 14:01:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:01:22,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 14:01:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:22,606 INFO L225 Difference]: With dead ends: 37597 [2019-12-18 14:01:22,606 INFO L226 Difference]: Without dead ends: 31105 [2019-12-18 14:01:22,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:01:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31105 states. [2019-12-18 14:01:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31105 to 16673. [2019-12-18 14:01:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 14:01:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49610 transitions. [2019-12-18 14:01:22,927 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49610 transitions. Word has length 67 [2019-12-18 14:01:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:22,927 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49610 transitions. [2019-12-18 14:01:22,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:01:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49610 transitions. [2019-12-18 14:01:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:22,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:22,942 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash 824690763, now seen corresponding path program 4 times [2019-12-18 14:01:22,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:22,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086518946] [2019-12-18 14:01:22,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:23,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086518946] [2019-12-18 14:01:23,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:23,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:01:23,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683507656] [2019-12-18 14:01:23,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:01:23,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:01:23,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:01:23,413 INFO L87 Difference]: Start difference. First operand 16673 states and 49610 transitions. Second operand 15 states. [2019-12-18 14:01:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:26,304 INFO L93 Difference]: Finished difference Result 24708 states and 72471 transitions. [2019-12-18 14:01:26,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:01:26,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 14:01:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:26,335 INFO L225 Difference]: With dead ends: 24708 [2019-12-18 14:01:26,335 INFO L226 Difference]: Without dead ends: 22329 [2019-12-18 14:01:26,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:01:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22329 states. [2019-12-18 14:01:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22329 to 16757. [2019-12-18 14:01:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16757 states. [2019-12-18 14:01:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16757 states to 16757 states and 49830 transitions. [2019-12-18 14:01:26,612 INFO L78 Accepts]: Start accepts. Automaton has 16757 states and 49830 transitions. Word has length 67 [2019-12-18 14:01:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:26,612 INFO L462 AbstractCegarLoop]: Abstraction has 16757 states and 49830 transitions. [2019-12-18 14:01:26,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:01:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 16757 states and 49830 transitions. [2019-12-18 14:01:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:26,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:26,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:26,628 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1145475155, now seen corresponding path program 5 times [2019-12-18 14:01:26,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:26,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476229238] [2019-12-18 14:01:26,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:27,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476229238] [2019-12-18 14:01:27,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:27,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:01:27,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085053578] [2019-12-18 14:01:27,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:01:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:01:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:01:27,017 INFO L87 Difference]: Start difference. First operand 16757 states and 49830 transitions. Second operand 16 states. [2019-12-18 14:01:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:29,567 INFO L93 Difference]: Finished difference Result 24250 states and 71116 transitions. [2019-12-18 14:01:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 14:01:29,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:01:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:29,597 INFO L225 Difference]: With dead ends: 24250 [2019-12-18 14:01:29,597 INFO L226 Difference]: Without dead ends: 21857 [2019-12-18 14:01:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 14:01:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21857 states. [2019-12-18 14:01:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21857 to 16595. [2019-12-18 14:01:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16595 states. [2019-12-18 14:01:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 49406 transitions. [2019-12-18 14:01:29,883 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 49406 transitions. Word has length 67 [2019-12-18 14:01:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 16595 states and 49406 transitions. [2019-12-18 14:01:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:01:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 49406 transitions. [2019-12-18 14:01:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:29,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:29,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:29,900 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash -719967029, now seen corresponding path program 6 times [2019-12-18 14:01:29,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:29,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926079928] [2019-12-18 14:01:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:01:30,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926079928] [2019-12-18 14:01:30,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:30,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:01:30,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638970843] [2019-12-18 14:01:30,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:30,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:30,027 INFO L87 Difference]: Start difference. First operand 16595 states and 49406 transitions. Second operand 9 states. [2019-12-18 14:01:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:31,427 INFO L93 Difference]: Finished difference Result 30323 states and 89521 transitions. [2019-12-18 14:01:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:01:31,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:01:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:31,464 INFO L225 Difference]: With dead ends: 30323 [2019-12-18 14:01:31,464 INFO L226 Difference]: Without dead ends: 26067 [2019-12-18 14:01:31,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:01:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26067 states. [2019-12-18 14:01:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26067 to 16571. [2019-12-18 14:01:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16571 states. [2019-12-18 14:01:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16571 states to 16571 states and 49340 transitions. [2019-12-18 14:01:31,755 INFO L78 Accepts]: Start accepts. Automaton has 16571 states and 49340 transitions. Word has length 67 [2019-12-18 14:01:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:31,755 INFO L462 AbstractCegarLoop]: Abstraction has 16571 states and 49340 transitions. [2019-12-18 14:01:31,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 16571 states and 49340 transitions. [2019-12-18 14:01:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:31,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:31,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:31,772 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 7 times [2019-12-18 14:01:31,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:31,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589276679] [2019-12-18 14:01:31,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:31,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:01:31,882 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:01:31,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_44|) 0) (= 0 |v_ULTIMATE.start_main_~#t1495~0.offset_28|) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1495~0.base_44| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 v_~z$r_buff0_thd3~0_371) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_44| 1)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_44|) |v_ULTIMATE.start_main_~#t1495~0.offset_28| 0))) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1495~0.base_44|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_18|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_25|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1495~0.offset=|v_ULTIMATE.start_main_~#t1495~0.offset_28|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1495~0.base=|v_ULTIMATE.start_main_~#t1495~0.base_44|, ~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_371, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1497~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1496~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1497~0.base, #NULL.base, ULTIMATE.start_main_~#t1495~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t1495~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 14:01:31,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1496~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1496~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13|) |v_ULTIMATE.start_main_~#t1496~0.offset_11| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1496~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1496~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1496~0.offset] because there is no mapped edge [2019-12-18 14:01:31,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13|) |v_ULTIMATE.start_main_~#t1497~0.offset_11| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1497~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1497~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1497~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1497~0.offset, #length, ULTIMATE.start_main_~#t1497~0.base] because there is no mapped edge [2019-12-18 14:01:31,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:01:31,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-223682529 256)))) (or (and (= ~z$w_buff0~0_In-223682529 |P2Thread1of1ForFork2_#t~ite21_Out-223682529|) (= |P2Thread1of1ForFork2_#t~ite20_In-223682529| |P2Thread1of1ForFork2_#t~ite20_Out-223682529|) (not .cse0)) (and (= ~z$w_buff0~0_In-223682529 |P2Thread1of1ForFork2_#t~ite20_Out-223682529|) (= |P2Thread1of1ForFork2_#t~ite21_Out-223682529| |P2Thread1of1ForFork2_#t~ite20_Out-223682529|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-223682529 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-223682529 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-223682529 256))) (= 0 (mod ~z$w_buff0_used~0_In-223682529 256))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-223682529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-223682529, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-223682529|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-223682529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-223682529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-223682529, ~weak$$choice2~0=~weak$$choice2~0_In-223682529} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-223682529, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-223682529|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-223682529, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-223682529|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-223682529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-223682529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-223682529, ~weak$$choice2~0=~weak$$choice2~0_In-223682529} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:01:31,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1908236788| |P1Thread1of1ForFork1_#t~ite10_Out-1908236788|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1908236788 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1908236788 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1908236788| ~z$w_buff1~0_In-1908236788)) (and .cse1 (= ~z~0_In-1908236788 |P1Thread1of1ForFork1_#t~ite9_Out-1908236788|) (or .cse2 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1908236788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1908236788, ~z$w_buff1~0=~z$w_buff1~0_In-1908236788, ~z~0=~z~0_In-1908236788} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1908236788|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1908236788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1908236788, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1908236788|, ~z$w_buff1~0=~z$w_buff1~0_In-1908236788, ~z~0=~z~0_In-1908236788} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:01:31,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1515786216 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1515786216 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1515786216|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1515786216 |P0Thread1of1ForFork0_#t~ite5_Out-1515786216|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1515786216, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1515786216} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1515786216|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1515786216, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1515786216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:01:31,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In534020143 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In534020143 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In534020143 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In534020143 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out534020143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In534020143 |P0Thread1of1ForFork0_#t~ite6_Out534020143|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In534020143, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In534020143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534020143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In534020143} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out534020143|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In534020143, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In534020143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534020143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In534020143} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:01:31,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-775907165 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-775907165 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-775907165 ~z$r_buff0_thd1~0_Out-775907165)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-775907165)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-775907165, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-775907165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-775907165, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-775907165|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-775907165} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:01:31,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In2097321800 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2097321800 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out2097321800|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out2097321800| ~z$w_buff0_used~0_In2097321800) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2097321800, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097321800} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2097321800, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2097321800|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2097321800} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:01:31,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1006591980 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1006591980 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1006591980 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1006591980 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1006591980| ~z$w_buff1_used~0_In-1006591980) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1006591980| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1006591980, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1006591980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1006591980, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1006591980} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1006591980, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1006591980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1006591980, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1006591980|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1006591980} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:01:31,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1311877659 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1311877659 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1311877659|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1311877659 |P1Thread1of1ForFork1_#t~ite13_Out1311877659|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1311877659, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1311877659} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1311877659, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1311877659|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1311877659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:01:31,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In556584478 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In556584478 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In556584478 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In556584478 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out556584478| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out556584478| ~z$r_buff1_thd2~0_In556584478) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In556584478, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In556584478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In556584478, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In556584478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In556584478, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In556584478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In556584478, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out556584478|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In556584478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:01:31,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:01:31,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:01:31,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In890036523 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_In890036523| |P2Thread1of1ForFork2_#t~ite35_Out890036523|) (not .cse0) (= ~z$r_buff1_thd3~0_In890036523 |P2Thread1of1ForFork2_#t~ite36_Out890036523|)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out890036523| |P2Thread1of1ForFork2_#t~ite35_Out890036523|) (= ~z$r_buff1_thd3~0_In890036523 |P2Thread1of1ForFork2_#t~ite35_Out890036523|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In890036523 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In890036523 256) 0)) (= (mod ~z$w_buff0_used~0_In890036523 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In890036523 256)) .cse1))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In890036523|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In890036523, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In890036523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890036523, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In890036523, ~weak$$choice2~0=~weak$$choice2~0_In890036523} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out890036523|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out890036523|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In890036523, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In890036523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890036523, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In890036523, ~weak$$choice2~0=~weak$$choice2~0_In890036523} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 14:01:31,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:01:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In602256893 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In602256893 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out602256893| |P2Thread1of1ForFork2_#t~ite38_Out602256893|))) (or (and (= ~z$w_buff1~0_In602256893 |P2Thread1of1ForFork2_#t~ite38_Out602256893|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out602256893| ~z~0_In602256893)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602256893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602256893, ~z$w_buff1~0=~z$w_buff1~0_In602256893, ~z~0=~z~0_In602256893} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In602256893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In602256893, ~z$w_buff1~0=~z$w_buff1~0_In602256893, ~z~0=~z~0_In602256893, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out602256893|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out602256893|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 14:01:31,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In87029400 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In87029400 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In87029400 |P2Thread1of1ForFork2_#t~ite40_Out87029400|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out87029400| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In87029400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In87029400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In87029400, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In87029400, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out87029400|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 14:01:31,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2089903627 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-2089903627 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-2089903627 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2089903627 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-2089903627| ~z$w_buff1_used~0_In-2089903627) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite41_Out-2089903627| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089903627, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2089903627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2089903627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2089903627} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2089903627|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089903627, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2089903627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2089903627, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2089903627} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 14:01:31,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In594738413 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In594738413 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In594738413 |P2Thread1of1ForFork2_#t~ite42_Out594738413|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out594738413|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In594738413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In594738413} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out594738413|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594738413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In594738413} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 14:01:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1284816567 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1284816567 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1284816567 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1284816567 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1284816567| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1284816567 |P2Thread1of1ForFork2_#t~ite43_Out-1284816567|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284816567, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1284816567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284816567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284816567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284816567, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1284816567, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1284816567|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284816567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1284816567} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:01:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:01:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In920883226 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In920883226 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In920883226 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In920883226 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In920883226 |P0Thread1of1ForFork0_#t~ite8_Out920883226|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out920883226|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In920883226, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In920883226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In920883226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In920883226} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In920883226, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out920883226|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In920883226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In920883226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In920883226} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:01:31,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:01:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:01:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-945344917| |ULTIMATE.start_main_#t~ite48_Out-945344917|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-945344917 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-945344917 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-945344917 |ULTIMATE.start_main_#t~ite47_Out-945344917|)) (and .cse0 (= ~z$w_buff1~0_In-945344917 |ULTIMATE.start_main_#t~ite47_Out-945344917|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-945344917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-945344917, ~z$w_buff1~0=~z$w_buff1~0_In-945344917, ~z~0=~z~0_In-945344917} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-945344917, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-945344917|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-945344917, ~z$w_buff1~0=~z$w_buff1~0_In-945344917, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-945344917|, ~z~0=~z~0_In-945344917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:01:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1874653424 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1874653424 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1874653424 |ULTIMATE.start_main_#t~ite49_Out1874653424|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1874653424|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1874653424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1874653424} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1874653424, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1874653424, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1874653424|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:01:31,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-830783434 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-830783434 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-830783434 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-830783434 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-830783434| ~z$w_buff1_used~0_In-830783434) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-830783434| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-830783434, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-830783434, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-830783434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-830783434} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-830783434|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-830783434, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-830783434, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-830783434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-830783434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:01:31,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1827828102 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1827828102 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1827828102| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1827828102 |ULTIMATE.start_main_#t~ite51_Out1827828102|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1827828102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1827828102} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1827828102, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1827828102|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1827828102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:01:31,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1844986877 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1844986877 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1844986877 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1844986877 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1844986877|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1844986877 |ULTIMATE.start_main_#t~ite52_Out1844986877|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844986877, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844986877, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844986877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844986877} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1844986877|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844986877, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844986877, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844986877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844986877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:01:31,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:01:32,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:01:32 BasicIcfg [2019-12-18 14:01:32,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:01:32,028 INFO L168 Benchmark]: Toolchain (without parser) took 117117.61 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,029 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.90 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 154.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.91 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,032 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 ms. Allocated memory is still 200.8 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,032 INFO L168 Benchmark]: RCFGBuilder took 873.57 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 99.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,032 INFO L168 Benchmark]: TraceAbstraction took 115326.58 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 14:01:32,036 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.90 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 154.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.91 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.19 ms. Allocated memory is still 200.8 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 873.57 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 99.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115326.58 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] FCALL, FORK 0 pthread_create(&t1496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t1497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 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}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 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 [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 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) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.9s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10118 SDtfs, 13306 SDslu, 34876 SDs, 0 SdLazy, 21853 SolverSat, 526 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 107 SyntacticMatches, 20 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2807 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 539353 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1791 NumberOfCodeBlocks, 1791 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1687 ConstructedInterpolants, 0 QuantifiedInterpolants, 338574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...