/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/mix015_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:32:54,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:32:54,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:32:54,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:32:54,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:32:54,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:32:54,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:32:54,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:32:54,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:32:54,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:32:54,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:32:54,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:32:54,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:32:54,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:32:54,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:32:54,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:32:54,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:32:54,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:32:54,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:32:54,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:32:54,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:32:54,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:32:54,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:32:54,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:32:54,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:32:54,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:32:54,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:32:54,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:32:54,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:32:54,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:32:54,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:32:54,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:32:54,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:32:54,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:32:54,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:32:54,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:32:54,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:32:54,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:32:54,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:32:54,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:32:54,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:32:54,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:32:54,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:32:54,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:32:54,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:32:54,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:32:54,804 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:32:54,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:32:54,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:32:54,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:32:54,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:32:54,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:32:54,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:32:54,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:32:54,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:32:54,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:32:54,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:32:54,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:32:54,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:32:54,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:32:54,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:32:54,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:32:54,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:32:54,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:32:54,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:32:54,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:32:54,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:32:54,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:32:54,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:32:54,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:32:54,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:32:54,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:32:55,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:32:55,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:32:55,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:32:55,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:32:55,115 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:32:55,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-18 12:32:55,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19d10b26/0af8645a0cba4fe4a2cf4b175c222bd5/FLAG98e753c3e [2019-12-18 12:32:55,729 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:32:55,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-18 12:32:55,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19d10b26/0af8645a0cba4fe4a2cf4b175c222bd5/FLAG98e753c3e [2019-12-18 12:32:55,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19d10b26/0af8645a0cba4fe4a2cf4b175c222bd5 [2019-12-18 12:32:56,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:32:56,004 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:32:56,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:32:56,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:32:56,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:32:56,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:32:55" (1/1) ... [2019-12-18 12:32:56,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79236124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56, skipping insertion in model container [2019-12-18 12:32:56,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:32:55" (1/1) ... [2019-12-18 12:32:56,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:32:56,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:32:56,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:32:56,570 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:32:56,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:32:56,722 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:32:56,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56 WrapperNode [2019-12-18 12:32:56,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:32:56,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:32:56,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:32:56,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:32:56,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:32:56,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:32:56,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:32:56,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:32:56,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... [2019-12-18 12:32:56,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:32:56,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:32:56,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:32:56,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:32:56,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:32:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:32:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:32:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:32:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:32:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:32:56,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:32:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:32:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:32:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:32:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:32:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:32:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:32:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:32:56,922 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:32:57,751 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:32:57,752 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:32:57,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:32:57 BoogieIcfgContainer [2019-12-18 12:32:57,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:32:57,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:32:57,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:32:57,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:32:57,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:32:55" (1/3) ... [2019-12-18 12:32:57,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bd468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:32:57, skipping insertion in model container [2019-12-18 12:32:57,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:56" (2/3) ... [2019-12-18 12:32:57,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bd468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:32:57, skipping insertion in model container [2019-12-18 12:32:57,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:32:57" (3/3) ... [2019-12-18 12:32:57,762 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.oepc.i [2019-12-18 12:32:57,772 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:32:57,772 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:32:57,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:32:57,780 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:32:57,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,848 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,884 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,886 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:57,920 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:32:57,940 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:32:57,941 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:32:57,941 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:32:57,941 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:32:57,941 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:32:57,941 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:32:57,941 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:32:57,942 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:32:57,959 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:32:57,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:32:58,065 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:32:58,065 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:32:58,089 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:32:58,116 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:32:58,193 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:32:58,193 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:32:58,202 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:32:58,223 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:32:58,224 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:33:03,749 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:33:03,887 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:33:04,035 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-18 12:33:04,036 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:33:04,040 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-18 12:33:22,915 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-18 12:33:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-18 12:33:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:33:22,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:22,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:33:22,924 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 12:33:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-18 12:33:22,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:22,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175340915] [2019-12-18 12:33:22,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:23,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175340915] [2019-12-18 12:33:23,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:23,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:33:23,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076590326] [2019-12-18 12:33:23,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:23,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:23,178 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-18 12:33:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:26,977 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-18 12:33:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:26,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:33:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:27,631 INFO L225 Difference]: With dead ends: 116858 [2019-12-18 12:33:27,631 INFO L226 Difference]: Without dead ends: 110138 [2019-12-18 12:33:27,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-18 12:33:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-18 12:33:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-18 12:33:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-18 12:33:35,894 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-18 12:33:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-18 12:33:35,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-18 12:33:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:33:35,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:35,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:35,899 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 12:33:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-18 12:33:35,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:35,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384700938] [2019-12-18 12:33:35,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:36,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384700938] [2019-12-18 12:33:36,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:36,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:36,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626062844] [2019-12-18 12:33:36,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:36,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:36,022 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-18 12:33:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:41,276 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-18 12:33:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:33:41,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:33:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:42,070 INFO L225 Difference]: With dead ends: 170904 [2019-12-18 12:33:42,071 INFO L226 Difference]: Without dead ends: 170855 [2019-12-18 12:33:42,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-18 12:33:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-18 12:33:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-18 12:33:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-18 12:33:54,301 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-18 12:33:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:54,301 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-18 12:33:54,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-18 12:33:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:33:54,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:54,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:54,312 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 12:33:54,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-18 12:33:54,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:54,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076575977] [2019-12-18 12:33:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:54,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076575977] [2019-12-18 12:33:54,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:54,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:54,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426652140] [2019-12-18 12:33:54,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:54,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:54,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:54,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:54,404 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-18 12:33:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:54,541 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-18 12:33:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:54,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:33:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:54,600 INFO L225 Difference]: With dead ends: 33673 [2019-12-18 12:33:54,600 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 12:33:54,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 12:34:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-18 12:34:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-18 12:34:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-18 12:34:00,258 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-18 12:34:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:00,259 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-18 12:34:00,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-18 12:34:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:34:00,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:00,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:00,266 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 12:34:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-18 12:34:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28944199] [2019-12-18 12:34:00,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:00,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28944199] [2019-12-18 12:34:00,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:00,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:00,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712284576] [2019-12-18 12:34:00,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:00,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:00,453 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-18 12:34:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:00,860 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-18 12:34:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:00,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:34:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:00,925 INFO L225 Difference]: With dead ends: 42056 [2019-12-18 12:34:00,925 INFO L226 Difference]: Without dead ends: 42056 [2019-12-18 12:34:00,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-18 12:34:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-18 12:34:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-18 12:34:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-18 12:34:02,625 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-18 12:34:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:02,630 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-18 12:34:02,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-18 12:34:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:34:02,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:02,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:02,646 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 12:34:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-18 12:34:02,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:02,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749846823] [2019-12-18 12:34:02,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:02,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749846823] [2019-12-18 12:34:02,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:02,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85455511] [2019-12-18 12:34:02,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:02,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:02,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:02,843 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-18 12:34:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:03,705 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-18 12:34:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:03,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:34:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:03,809 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 12:34:03,810 INFO L226 Difference]: Without dead ends: 48530 [2019-12-18 12:34:03,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 12:34:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-18 12:34:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-18 12:34:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-18 12:34:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-18 12:34:04,889 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-18 12:34:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:04,890 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-18 12:34:04,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-18 12:34:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:34:04,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:04,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:04,908 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 12:34:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-18 12:34:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:04,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558255380] [2019-12-18 12:34:04,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:04,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558255380] [2019-12-18 12:34:04,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:04,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:04,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914096184] [2019-12-18 12:34:04,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:04,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:04,999 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-18 12:34:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:05,081 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-18 12:34:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:05,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:34:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:05,110 INFO L225 Difference]: With dead ends: 14576 [2019-12-18 12:34:05,111 INFO L226 Difference]: Without dead ends: 14576 [2019-12-18 12:34:05,111 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 12:34:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-18 12:34:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-18 12:34:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-18 12:34:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-18 12:34:05,724 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-18 12:34:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:05,725 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-18 12:34:05,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-18 12:34:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:05,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:05,740 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 12:34:05,741 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 12:34:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-18 12:34:05,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:05,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593697172] [2019-12-18 12:34:05,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:05,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593697172] [2019-12-18 12:34:05,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:05,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:05,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696546723] [2019-12-18 12:34:05,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:05,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:05,780 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-18 12:34:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:05,891 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-18 12:34:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:05,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:05,922 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:34:05,922 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:34:05,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:34:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:34:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:34:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-18 12:34:06,216 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-18 12:34:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:06,217 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-18 12:34:06,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-18 12:34:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:06,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:06,230 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 12:34:06,230 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 12:34:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-18 12:34:06,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:06,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305807459] [2019-12-18 12:34:06,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:06,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305807459] [2019-12-18 12:34:06,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:06,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:06,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588225499] [2019-12-18 12:34:06,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:06,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:06,277 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-18 12:34:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:06,375 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-18 12:34:06,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:06,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:06,406 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:34:06,407 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:34:06,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:34:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:34:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:34:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-18 12:34:06,721 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-18 12:34:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:06,722 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-18 12:34:06,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-18 12:34:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:06,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:06,735 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 12:34:06,735 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 12:34:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-18 12:34:06,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:06,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056201357] [2019-12-18 12:34:06,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:06,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056201357] [2019-12-18 12:34:06,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:06,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:06,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670719894] [2019-12-18 12:34:06,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:06,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:06,823 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-18 12:34:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:07,437 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-18 12:34:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:07,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:34:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:07,484 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 12:34:07,485 INFO L226 Difference]: Without dead ends: 31275 [2019-12-18 12:34:07,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-18 12:34:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-18 12:34:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-18 12:34:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-18 12:34:07,875 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-18 12:34:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-18 12:34:07,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-18 12:34:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:34:07,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:07,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:07,891 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 12:34:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-18 12:34:07,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:07,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529393189] [2019-12-18 12:34:07,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:08,274 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 12:34:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:08,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529393189] [2019-12-18 12:34:08,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:08,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:08,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736722231] [2019-12-18 12:34:08,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:08,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:08,298 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-18 12:34:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:08,960 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-18 12:34:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:08,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:34:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:09,002 INFO L225 Difference]: With dead ends: 30618 [2019-12-18 12:34:09,002 INFO L226 Difference]: Without dead ends: 30618 [2019-12-18 12:34:09,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-18 12:34:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-18 12:34:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-18 12:34:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-18 12:34:09,375 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-18 12:34:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:09,375 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-18 12:34:09,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-18 12:34:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:09,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:09,395 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 12:34:09,396 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 12:34:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-18 12:34:09,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:09,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491320422] [2019-12-18 12:34:09,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:09,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491320422] [2019-12-18 12:34:09,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:09,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:09,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206239434] [2019-12-18 12:34:09,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:09,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:09,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:09,493 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 6 states. [2019-12-18 12:34:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:10,053 INFO L93 Difference]: Finished difference Result 24609 states and 72444 transitions. [2019-12-18 12:34:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:10,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:34:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:10,086 INFO L225 Difference]: With dead ends: 24609 [2019-12-18 12:34:10,086 INFO L226 Difference]: Without dead ends: 24609 [2019-12-18 12:34:10,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24609 states. [2019-12-18 12:34:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24609 to 19900. [2019-12-18 12:34:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19900 states. [2019-12-18 12:34:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19900 states to 19900 states and 59467 transitions. [2019-12-18 12:34:10,399 INFO L78 Accepts]: Start accepts. Automaton has 19900 states and 59467 transitions. Word has length 33 [2019-12-18 12:34:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:10,400 INFO L462 AbstractCegarLoop]: Abstraction has 19900 states and 59467 transitions. [2019-12-18 12:34:10,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 19900 states and 59467 transitions. [2019-12-18 12:34:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:10,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:10,421 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 12:34:10,422 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 12:34:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-18 12:34:10,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:10,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544191060] [2019-12-18 12:34:10,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:10,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544191060] [2019-12-18 12:34:10,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:10,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:34:10,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510510660] [2019-12-18 12:34:10,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:10,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:10,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:10,533 INFO L87 Difference]: Start difference. First operand 19900 states and 59467 transitions. Second operand 7 states. [2019-12-18 12:34:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:12,115 INFO L93 Difference]: Finished difference Result 41205 states and 121054 transitions. [2019-12-18 12:34:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:12,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:34:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:12,170 INFO L225 Difference]: With dead ends: 41205 [2019-12-18 12:34:12,170 INFO L226 Difference]: Without dead ends: 41205 [2019-12-18 12:34:12,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-18 12:34:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 21428. [2019-12-18 12:34:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21428 states. [2019-12-18 12:34:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21428 states to 21428 states and 64061 transitions. [2019-12-18 12:34:12,612 INFO L78 Accepts]: Start accepts. Automaton has 21428 states and 64061 transitions. Word has length 33 [2019-12-18 12:34:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:12,612 INFO L462 AbstractCegarLoop]: Abstraction has 21428 states and 64061 transitions. [2019-12-18 12:34:12,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21428 states and 64061 transitions. [2019-12-18 12:34:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:34:12,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:12,630 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 12:34:12,630 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 12:34:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-18 12:34:12,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:12,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99085937] [2019-12-18 12:34:12,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:12,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99085937] [2019-12-18 12:34:12,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:12,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:34:12,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215424433] [2019-12-18 12:34:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:12,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:12,794 INFO L87 Difference]: Start difference. First operand 21428 states and 64061 transitions. Second operand 9 states. [2019-12-18 12:34:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:14,506 INFO L93 Difference]: Finished difference Result 31873 states and 93992 transitions. [2019-12-18 12:34:14,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:34:14,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 12:34:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:14,552 INFO L225 Difference]: With dead ends: 31873 [2019-12-18 12:34:14,552 INFO L226 Difference]: Without dead ends: 31873 [2019-12-18 12:34:14,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:34:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31873 states. [2019-12-18 12:34:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31873 to 20792. [2019-12-18 12:34:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-12-18 12:34:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 62165 transitions. [2019-12-18 12:34:14,934 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 62165 transitions. Word has length 33 [2019-12-18 12:34:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:14,935 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 62165 transitions. [2019-12-18 12:34:14,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 62165 transitions. [2019-12-18 12:34:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:34:14,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:14,953 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 12:34:14,953 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 12:34:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-18 12:34:14,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:14,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933973074] [2019-12-18 12:34:14,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:15,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933973074] [2019-12-18 12:34:15,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:15,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:34:15,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631731626] [2019-12-18 12:34:15,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:15,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:15,075 INFO L87 Difference]: Start difference. First operand 20792 states and 62165 transitions. Second operand 7 states. [2019-12-18 12:34:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:16,605 INFO L93 Difference]: Finished difference Result 36282 states and 106307 transitions. [2019-12-18 12:34:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:16,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:34:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:16,663 INFO L225 Difference]: With dead ends: 36282 [2019-12-18 12:34:16,664 INFO L226 Difference]: Without dead ends: 36282 [2019-12-18 12:34:16,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36282 states. [2019-12-18 12:34:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36282 to 19630. [2019-12-18 12:34:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19630 states. [2019-12-18 12:34:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19630 states to 19630 states and 58823 transitions. [2019-12-18 12:34:17,043 INFO L78 Accepts]: Start accepts. Automaton has 19630 states and 58823 transitions. Word has length 34 [2019-12-18 12:34:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:17,043 INFO L462 AbstractCegarLoop]: Abstraction has 19630 states and 58823 transitions. [2019-12-18 12:34:17,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19630 states and 58823 transitions. [2019-12-18 12:34:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:34:17,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:17,060 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 12:34:17,060 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 12:34:17,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-18 12:34:17,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:17,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604923870] [2019-12-18 12:34:17,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:17,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604923870] [2019-12-18 12:34:17,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:17,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:17,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763033034] [2019-12-18 12:34:17,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:34:17,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:34:17,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:34:17,180 INFO L87 Difference]: Start difference. First operand 19630 states and 58823 transitions. Second operand 8 states. [2019-12-18 12:34:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:18,700 INFO L93 Difference]: Finished difference Result 41307 states and 119689 transitions. [2019-12-18 12:34:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:34:18,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:34:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:18,776 INFO L225 Difference]: With dead ends: 41307 [2019-12-18 12:34:18,776 INFO L226 Difference]: Without dead ends: 41307 [2019-12-18 12:34:18,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:34:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41307 states. [2019-12-18 12:34:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41307 to 17930. [2019-12-18 12:34:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17930 states. [2019-12-18 12:34:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17930 states to 17930 states and 53783 transitions. [2019-12-18 12:34:19,208 INFO L78 Accepts]: Start accepts. Automaton has 17930 states and 53783 transitions. Word has length 34 [2019-12-18 12:34:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:19,208 INFO L462 AbstractCegarLoop]: Abstraction has 17930 states and 53783 transitions. [2019-12-18 12:34:19,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:34:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17930 states and 53783 transitions. [2019-12-18 12:34:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:34:19,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:19,231 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 12:34:19,232 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 12:34:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-18 12:34:19,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:19,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101297267] [2019-12-18 12:34:19,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:19,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101297267] [2019-12-18 12:34:19,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:19,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:19,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983591307] [2019-12-18 12:34:19,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:19,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:19,293 INFO L87 Difference]: Start difference. First operand 17930 states and 53783 transitions. Second operand 4 states. [2019-12-18 12:34:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:19,392 INFO L93 Difference]: Finished difference Result 30507 states and 91836 transitions. [2019-12-18 12:34:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:19,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 12:34:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:19,415 INFO L225 Difference]: With dead ends: 30507 [2019-12-18 12:34:19,415 INFO L226 Difference]: Without dead ends: 15439 [2019-12-18 12:34:19,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15439 states. [2019-12-18 12:34:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15439 to 15355. [2019-12-18 12:34:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15355 states. [2019-12-18 12:34:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15355 states to 15355 states and 45258 transitions. [2019-12-18 12:34:20,013 INFO L78 Accepts]: Start accepts. Automaton has 15355 states and 45258 transitions. Word has length 39 [2019-12-18 12:34:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:20,013 INFO L462 AbstractCegarLoop]: Abstraction has 15355 states and 45258 transitions. [2019-12-18 12:34:20,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15355 states and 45258 transitions. [2019-12-18 12:34:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:34:20,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:20,030 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 12:34:20,030 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 12:34:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-18 12:34:20,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:20,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341505844] [2019-12-18 12:34:20,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:20,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341505844] [2019-12-18 12:34:20,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:20,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:34:20,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875536425] [2019-12-18 12:34:20,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:20,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:20,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:20,101 INFO L87 Difference]: Start difference. First operand 15355 states and 45258 transitions. Second operand 3 states. [2019-12-18 12:34:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:20,169 INFO L93 Difference]: Finished difference Result 15354 states and 45256 transitions. [2019-12-18 12:34:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:20,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:34:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:20,196 INFO L225 Difference]: With dead ends: 15354 [2019-12-18 12:34:20,196 INFO L226 Difference]: Without dead ends: 15354 [2019-12-18 12:34:20,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15354 states. [2019-12-18 12:34:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15354 to 15354. [2019-12-18 12:34:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2019-12-18 12:34:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 45256 transitions. [2019-12-18 12:34:20,418 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 45256 transitions. Word has length 39 [2019-12-18 12:34:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:20,418 INFO L462 AbstractCegarLoop]: Abstraction has 15354 states and 45256 transitions. [2019-12-18 12:34:20,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 45256 transitions. [2019-12-18 12:34:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:34:20,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:20,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:20,431 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 12:34:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-18 12:34:20,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:20,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139029364] [2019-12-18 12:34:20,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:20,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139029364] [2019-12-18 12:34:20,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:20,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:20,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553259913] [2019-12-18 12:34:20,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:20,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:20,481 INFO L87 Difference]: Start difference. First operand 15354 states and 45256 transitions. Second operand 4 states. [2019-12-18 12:34:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:20,568 INFO L93 Difference]: Finished difference Result 24489 states and 72527 transitions. [2019-12-18 12:34:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:20,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:34:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:20,585 INFO L225 Difference]: With dead ends: 24489 [2019-12-18 12:34:20,585 INFO L226 Difference]: Without dead ends: 11193 [2019-12-18 12:34:20,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2019-12-18 12:34:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 11100. [2019-12-18 12:34:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11100 states. [2019-12-18 12:34:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 31843 transitions. [2019-12-18 12:34:20,746 INFO L78 Accepts]: Start accepts. Automaton has 11100 states and 31843 transitions. Word has length 40 [2019-12-18 12:34:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:20,746 INFO L462 AbstractCegarLoop]: Abstraction has 11100 states and 31843 transitions. [2019-12-18 12:34:20,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11100 states and 31843 transitions. [2019-12-18 12:34:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:34:20,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:20,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:20,757 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 12:34:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-18 12:34:20,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:20,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327283895] [2019-12-18 12:34:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:20,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327283895] [2019-12-18 12:34:20,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:20,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:20,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076465382] [2019-12-18 12:34:20,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:20,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:20,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:20,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:20,809 INFO L87 Difference]: Start difference. First operand 11100 states and 31843 transitions. Second operand 5 states. [2019-12-18 12:34:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:20,870 INFO L93 Difference]: Finished difference Result 10138 states and 29702 transitions. [2019-12-18 12:34:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:20,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:34:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:20,882 INFO L225 Difference]: With dead ends: 10138 [2019-12-18 12:34:20,882 INFO L226 Difference]: Without dead ends: 7230 [2019-12-18 12:34:20,882 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 12:34:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-18 12:34:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-18 12:34:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-18 12:34:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-18 12:34:21,000 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-18 12:34:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:21,000 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-18 12:34:21,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-18 12:34:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:21,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:21,009 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 12:34:21,009 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 12:34:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-18 12:34:21,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:21,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159993655] [2019-12-18 12:34:21,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:21,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159993655] [2019-12-18 12:34:21,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:21,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:21,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812004101] [2019-12-18 12:34:21,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:21,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:21,102 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-18 12:34:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:21,467 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-18 12:34:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:34:21,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:34:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:21,495 INFO L225 Difference]: With dead ends: 14425 [2019-12-18 12:34:21,496 INFO L226 Difference]: Without dead ends: 10624 [2019-12-18 12:34:21,496 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 12:34:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-18 12:34:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-18 12:34:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-18 12:34:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-18 12:34:21,826 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-18 12:34:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:21,827 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-18 12:34:21,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-18 12:34:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:21,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:21,847 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 12:34:21,847 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 12:34:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-18 12:34:21,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:21,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650374241] [2019-12-18 12:34:21,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:21,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650374241] [2019-12-18 12:34:21,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:21,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:21,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018403408] [2019-12-18 12:34:21,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:34:21,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:34:21,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:21,991 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-18 12:34:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:22,286 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-18 12:34:22,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:34:22,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:34:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:22,308 INFO L225 Difference]: With dead ends: 16977 [2019-12-18 12:34:22,308 INFO L226 Difference]: Without dead ends: 12608 [2019-12-18 12:34:22,309 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 12:34:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-18 12:34:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-18 12:34:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-18 12:34:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-18 12:34:22,486 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-18 12:34:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:22,487 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-18 12:34:22,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:34:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-18 12:34:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:22,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:22,498 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 12:34:22,499 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 12:34:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-18 12:34:22,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:22,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193921981] [2019-12-18 12:34:22,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:22,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193921981] [2019-12-18 12:34:22,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:22,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:22,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236809985] [2019-12-18 12:34:22,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:22,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:22,613 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-18 12:34:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:23,844 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-18 12:34:23,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:34:23,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:34:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:23,883 INFO L225 Difference]: With dead ends: 29742 [2019-12-18 12:34:23,883 INFO L226 Difference]: Without dead ends: 27534 [2019-12-18 12:34:23,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:34:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-18 12:34:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-18 12:34:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-18 12:34:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-18 12:34:24,156 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-18 12:34:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-18 12:34:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-18 12:34:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:24,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:24,167 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 12:34:24,167 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 12:34:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-18 12:34:24,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:24,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463450993] [2019-12-18 12:34:24,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:24,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463450993] [2019-12-18 12:34:24,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:24,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:24,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760592583] [2019-12-18 12:34:24,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:24,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:24,290 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-18 12:34:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:25,474 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-18 12:34:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:34:25,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:34:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:25,528 INFO L225 Difference]: With dead ends: 23762 [2019-12-18 12:34:25,528 INFO L226 Difference]: Without dead ends: 22008 [2019-12-18 12:34:25,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:34:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-18 12:34:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-18 12:34:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-18 12:34:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-18 12:34:26,054 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-18 12:34:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:26,054 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-18 12:34:26,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-18 12:34:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:34:26,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:26,077 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 12:34:26,077 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 12:34:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-18 12:34:26,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:26,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393049400] [2019-12-18 12:34:26,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:26,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393049400] [2019-12-18 12:34:26,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:26,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:26,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797267691] [2019-12-18 12:34:26,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:26,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:26,188 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-18 12:34:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:26,329 INFO L93 Difference]: Finished difference Result 11837 states and 37523 transitions. [2019-12-18 12:34:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:26,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:34:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:26,354 INFO L225 Difference]: With dead ends: 11837 [2019-12-18 12:34:26,354 INFO L226 Difference]: Without dead ends: 11837 [2019-12-18 12:34:26,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-12-18 12:34:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10693. [2019-12-18 12:34:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-18 12:34:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 34091 transitions. [2019-12-18 12:34:26,643 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 34091 transitions. Word has length 64 [2019-12-18 12:34:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:26,643 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 34091 transitions. [2019-12-18 12:34:26,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 34091 transitions. [2019-12-18 12:34:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:26,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:26,662 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 12:34:26,662 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 12:34:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-18 12:34:26,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:26,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437289948] [2019-12-18 12:34:26,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:26,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437289948] [2019-12-18 12:34:26,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:26,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:26,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545312438] [2019-12-18 12:34:26,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:26,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:26,790 INFO L87 Difference]: Start difference. First operand 10693 states and 34091 transitions. Second operand 9 states. [2019-12-18 12:34:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:27,951 INFO L93 Difference]: Finished difference Result 25976 states and 80362 transitions. [2019-12-18 12:34:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:34:27,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:34:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:27,981 INFO L225 Difference]: With dead ends: 25976 [2019-12-18 12:34:27,982 INFO L226 Difference]: Without dead ends: 21905 [2019-12-18 12:34:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:34:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2019-12-18 12:34:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 10558. [2019-12-18 12:34:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10558 states. [2019-12-18 12:34:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 33265 transitions. [2019-12-18 12:34:28,215 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 33265 transitions. Word has length 65 [2019-12-18 12:34:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:28,215 INFO L462 AbstractCegarLoop]: Abstraction has 10558 states and 33265 transitions. [2019-12-18 12:34:28,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 33265 transitions. [2019-12-18 12:34:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:28,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:28,227 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 12:34:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1962638562, now seen corresponding path program 2 times [2019-12-18 12:34:28,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:28,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618834500] [2019-12-18 12:34:28,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:28,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618834500] [2019-12-18 12:34:28,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:28,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:28,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236063407] [2019-12-18 12:34:28,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:28,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:28,355 INFO L87 Difference]: Start difference. First operand 10558 states and 33265 transitions. Second operand 9 states. [2019-12-18 12:34:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:29,407 INFO L93 Difference]: Finished difference Result 21151 states and 64928 transitions. [2019-12-18 12:34:29,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:29,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:34:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:29,445 INFO L225 Difference]: With dead ends: 21151 [2019-12-18 12:34:29,445 INFO L226 Difference]: Without dead ends: 19285 [2019-12-18 12:34:29,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:34:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-12-18 12:34:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 10198. [2019-12-18 12:34:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-18 12:34:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 32203 transitions. [2019-12-18 12:34:29,737 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 32203 transitions. Word has length 65 [2019-12-18 12:34:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:29,737 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 32203 transitions. [2019-12-18 12:34:29,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 32203 transitions. [2019-12-18 12:34:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:29,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:29,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:29,749 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 12:34:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 3 times [2019-12-18 12:34:29,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:29,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655950185] [2019-12-18 12:34:29,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:29,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655950185] [2019-12-18 12:34:29,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:29,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:29,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742991242] [2019-12-18 12:34:29,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:29,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:29,815 INFO L87 Difference]: Start difference. First operand 10198 states and 32203 transitions. Second operand 4 states. [2019-12-18 12:34:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:29,938 INFO L93 Difference]: Finished difference Result 10055 states and 31631 transitions. [2019-12-18 12:34:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:29,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:34:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:29,952 INFO L225 Difference]: With dead ends: 10055 [2019-12-18 12:34:29,952 INFO L226 Difference]: Without dead ends: 10055 [2019-12-18 12:34:29,952 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 12:34:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-18 12:34:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 9626. [2019-12-18 12:34:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9626 states. [2019-12-18 12:34:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 30201 transitions. [2019-12-18 12:34:30,103 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 30201 transitions. Word has length 65 [2019-12-18 12:34:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:30,103 INFO L462 AbstractCegarLoop]: Abstraction has 9626 states and 30201 transitions. [2019-12-18 12:34:30,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 30201 transitions. [2019-12-18 12:34:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:30,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:30,113 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 12:34:30,113 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 12:34:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-18 12:34:30,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:30,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996326756] [2019-12-18 12:34:30,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:30,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996326756] [2019-12-18 12:34:30,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:30,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:34:30,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871604535] [2019-12-18 12:34:30,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:30,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:30,322 INFO L87 Difference]: Start difference. First operand 9626 states and 30201 transitions. Second operand 9 states. [2019-12-18 12:34:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:32,708 INFO L93 Difference]: Finished difference Result 26641 states and 79803 transitions. [2019-12-18 12:34:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:34:32,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:34:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:32,747 INFO L225 Difference]: With dead ends: 26641 [2019-12-18 12:34:32,747 INFO L226 Difference]: Without dead ends: 26401 [2019-12-18 12:34:32,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:34:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26401 states. [2019-12-18 12:34:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26401 to 15099. [2019-12-18 12:34:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15099 states. [2019-12-18 12:34:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15099 states to 15099 states and 45910 transitions. [2019-12-18 12:34:33,073 INFO L78 Accepts]: Start accepts. Automaton has 15099 states and 45910 transitions. Word has length 65 [2019-12-18 12:34:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:33,073 INFO L462 AbstractCegarLoop]: Abstraction has 15099 states and 45910 transitions. [2019-12-18 12:34:33,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 15099 states and 45910 transitions. [2019-12-18 12:34:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:33,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:33,090 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 12:34:33,091 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 12:34:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash -236370469, now seen corresponding path program 2 times [2019-12-18 12:34:33,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:33,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009953982] [2019-12-18 12:34:33,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:33,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009953982] [2019-12-18 12:34:33,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:33,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:34:33,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148629970] [2019-12-18 12:34:33,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:33,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:33,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:33,294 INFO L87 Difference]: Start difference. First operand 15099 states and 45910 transitions. Second operand 10 states. [2019-12-18 12:34:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:35,383 INFO L93 Difference]: Finished difference Result 29347 states and 87356 transitions. [2019-12-18 12:34:35,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:34:35,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:34:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:35,422 INFO L225 Difference]: With dead ends: 29347 [2019-12-18 12:34:35,422 INFO L226 Difference]: Without dead ends: 29347 [2019-12-18 12:34:35,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:34:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29347 states. [2019-12-18 12:34:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29347 to 17301. [2019-12-18 12:34:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-12-18 12:34:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 52221 transitions. [2019-12-18 12:34:35,776 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 52221 transitions. Word has length 65 [2019-12-18 12:34:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:35,776 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 52221 transitions. [2019-12-18 12:34:35,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 52221 transitions. [2019-12-18 12:34:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:34:35,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:35,795 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 12:34:35,795 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 12:34:35,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:35,795 INFO L82 PathProgramCache]: Analyzing trace with hash 371994719, now seen corresponding path program 3 times [2019-12-18 12:34:35,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:35,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205267784] [2019-12-18 12:34:35,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:35,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205267784] [2019-12-18 12:34:35,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:35,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:35,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713251533] [2019-12-18 12:34:35,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:35,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:35,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:35,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:35,855 INFO L87 Difference]: Start difference. First operand 17301 states and 52221 transitions. Second operand 3 states. [2019-12-18 12:34:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:35,948 INFO L93 Difference]: Finished difference Result 17300 states and 52219 transitions. [2019-12-18 12:34:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:35,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:34:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:35,986 INFO L225 Difference]: With dead ends: 17300 [2019-12-18 12:34:35,986 INFO L226 Difference]: Without dead ends: 17300 [2019-12-18 12:34:35,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17300 states. [2019-12-18 12:34:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17300 to 13129. [2019-12-18 12:34:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13129 states. [2019-12-18 12:34:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13129 states to 13129 states and 40482 transitions. [2019-12-18 12:34:36,436 INFO L78 Accepts]: Start accepts. Automaton has 13129 states and 40482 transitions. Word has length 65 [2019-12-18 12:34:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:36,436 INFO L462 AbstractCegarLoop]: Abstraction has 13129 states and 40482 transitions. [2019-12-18 12:34:36,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 13129 states and 40482 transitions. [2019-12-18 12:34:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:34:36,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:36,457 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 12:34:36,458 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 12:34:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-18 12:34:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6496036] [2019-12-18 12:34:36,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:36,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6496036] [2019-12-18 12:34:36,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:36,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:36,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135074659] [2019-12-18 12:34:36,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:36,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:36,534 INFO L87 Difference]: Start difference. First operand 13129 states and 40482 transitions. Second operand 3 states. [2019-12-18 12:34:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:36,591 INFO L93 Difference]: Finished difference Result 11202 states and 33879 transitions. [2019-12-18 12:34:36,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:36,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:34:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:36,610 INFO L225 Difference]: With dead ends: 11202 [2019-12-18 12:34:36,611 INFO L226 Difference]: Without dead ends: 11202 [2019-12-18 12:34:36,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2019-12-18 12:34:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 10986. [2019-12-18 12:34:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10986 states. [2019-12-18 12:34:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10986 states to 10986 states and 33244 transitions. [2019-12-18 12:34:36,809 INFO L78 Accepts]: Start accepts. Automaton has 10986 states and 33244 transitions. Word has length 66 [2019-12-18 12:34:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:36,810 INFO L462 AbstractCegarLoop]: Abstraction has 10986 states and 33244 transitions. [2019-12-18 12:34:36,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10986 states and 33244 transitions. [2019-12-18 12:34:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:36,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:36,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:36,820 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 12:34:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-18 12:34:36,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:36,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394520017] [2019-12-18 12:34:36,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:36,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394520017] [2019-12-18 12:34:36,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:36,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:34:36,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422922453] [2019-12-18 12:34:36,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:34:36,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:34:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:36,948 INFO L87 Difference]: Start difference. First operand 10986 states and 33244 transitions. Second operand 9 states. [2019-12-18 12:34:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:38,117 INFO L93 Difference]: Finished difference Result 20793 states and 62007 transitions. [2019-12-18 12:34:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:34:38,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:34:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:38,138 INFO L225 Difference]: With dead ends: 20793 [2019-12-18 12:34:38,138 INFO L226 Difference]: Without dead ends: 15088 [2019-12-18 12:34:38,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:34:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15088 states. [2019-12-18 12:34:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15088 to 11693. [2019-12-18 12:34:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-12-18 12:34:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35021 transitions. [2019-12-18 12:34:38,336 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35021 transitions. Word has length 67 [2019-12-18 12:34:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35021 transitions. [2019-12-18 12:34:38,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:34:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35021 transitions. [2019-12-18 12:34:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:38,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:38,349 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 12:34:38,349 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 12:34:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-18 12:34:38,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:38,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90335460] [2019-12-18 12:34:38,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:38,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90335460] [2019-12-18 12:34:38,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:38,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:38,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902897314] [2019-12-18 12:34:38,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:38,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:38,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:38,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:38,601 INFO L87 Difference]: Start difference. First operand 11693 states and 35021 transitions. Second operand 10 states. [2019-12-18 12:34:39,420 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 12:34:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:39,457 INFO L93 Difference]: Finished difference Result 17252 states and 51068 transitions. [2019-12-18 12:34:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:34:39,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:39,478 INFO L225 Difference]: With dead ends: 17252 [2019-12-18 12:34:39,478 INFO L226 Difference]: Without dead ends: 16233 [2019-12-18 12:34:39,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:34:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16233 states. [2019-12-18 12:34:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16233 to 13508. [2019-12-18 12:34:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13508 states. [2019-12-18 12:34:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13508 states to 13508 states and 40208 transitions. [2019-12-18 12:34:39,697 INFO L78 Accepts]: Start accepts. Automaton has 13508 states and 40208 transitions. Word has length 67 [2019-12-18 12:34:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:39,698 INFO L462 AbstractCegarLoop]: Abstraction has 13508 states and 40208 transitions. [2019-12-18 12:34:39,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13508 states and 40208 transitions. [2019-12-18 12:34:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:39,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:39,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:39,714 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 12:34:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-18 12:34:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:39,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134183641] [2019-12-18 12:34:39,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:39,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134183641] [2019-12-18 12:34:39,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:39,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:39,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932421151] [2019-12-18 12:34:39,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:39,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:39,862 INFO L87 Difference]: Start difference. First operand 13508 states and 40208 transitions. Second operand 10 states. [2019-12-18 12:34:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:40,508 INFO L93 Difference]: Finished difference Result 16786 states and 49187 transitions. [2019-12-18 12:34:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:34:40,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:40,533 INFO L225 Difference]: With dead ends: 16786 [2019-12-18 12:34:40,533 INFO L226 Difference]: Without dead ends: 14327 [2019-12-18 12:34:40,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:34:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2019-12-18 12:34:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 11301. [2019-12-18 12:34:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11301 states. [2019-12-18 12:34:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11301 states to 11301 states and 33872 transitions. [2019-12-18 12:34:40,744 INFO L78 Accepts]: Start accepts. Automaton has 11301 states and 33872 transitions. Word has length 67 [2019-12-18 12:34:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:40,744 INFO L462 AbstractCegarLoop]: Abstraction has 11301 states and 33872 transitions. [2019-12-18 12:34:40,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11301 states and 33872 transitions. [2019-12-18 12:34:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:40,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:40,759 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 12:34:40,759 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 12:34:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-18 12:34:40,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:40,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016418465] [2019-12-18 12:34:40,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:40,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016418465] [2019-12-18 12:34:40,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:40,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:34:40,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759025871] [2019-12-18 12:34:40,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:34:40,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:34:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:34:40,943 INFO L87 Difference]: Start difference. First operand 11301 states and 33872 transitions. Second operand 11 states. [2019-12-18 12:34:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:41,790 INFO L93 Difference]: Finished difference Result 17829 states and 53250 transitions. [2019-12-18 12:34:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:34:41,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:34:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:41,814 INFO L225 Difference]: With dead ends: 17829 [2019-12-18 12:34:41,815 INFO L226 Difference]: Without dead ends: 16810 [2019-12-18 12:34:41,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:34:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16810 states. [2019-12-18 12:34:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16810 to 14864. [2019-12-18 12:34:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14864 states. [2019-12-18 12:34:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14864 states to 14864 states and 44714 transitions. [2019-12-18 12:34:42,058 INFO L78 Accepts]: Start accepts. Automaton has 14864 states and 44714 transitions. Word has length 67 [2019-12-18 12:34:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:42,058 INFO L462 AbstractCegarLoop]: Abstraction has 14864 states and 44714 transitions. [2019-12-18 12:34:42,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:34:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14864 states and 44714 transitions. [2019-12-18 12:34:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:42,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:42,074 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 12:34:42,074 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 12:34:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 5 times [2019-12-18 12:34:42,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:42,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127033846] [2019-12-18 12:34:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:42,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127033846] [2019-12-18 12:34:42,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:42,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:34:42,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617924895] [2019-12-18 12:34:42,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:34:42,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:34:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:34:42,246 INFO L87 Difference]: Start difference. First operand 14864 states and 44714 transitions. Second operand 11 states. [2019-12-18 12:34:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:42,998 INFO L93 Difference]: Finished difference Result 17542 states and 51777 transitions. [2019-12-18 12:34:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:34:42,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:34:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:43,017 INFO L225 Difference]: With dead ends: 17542 [2019-12-18 12:34:43,017 INFO L226 Difference]: Without dead ends: 13536 [2019-12-18 12:34:43,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:34:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13536 states. [2019-12-18 12:34:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13536 to 11327. [2019-12-18 12:34:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11327 states. [2019-12-18 12:34:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11327 states to 11327 states and 33809 transitions. [2019-12-18 12:34:43,214 INFO L78 Accepts]: Start accepts. Automaton has 11327 states and 33809 transitions. Word has length 67 [2019-12-18 12:34:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:43,214 INFO L462 AbstractCegarLoop]: Abstraction has 11327 states and 33809 transitions. [2019-12-18 12:34:43,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:34:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 11327 states and 33809 transitions. [2019-12-18 12:34:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:43,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:43,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:43,227 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 12:34:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-18 12:34:43,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:43,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752862707] [2019-12-18 12:34:43,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:43,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752862707] [2019-12-18 12:34:43,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:43,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:43,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642330207] [2019-12-18 12:34:43,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:43,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:43,383 INFO L87 Difference]: Start difference. First operand 11327 states and 33809 transitions. Second operand 10 states. [2019-12-18 12:34:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:44,675 INFO L93 Difference]: Finished difference Result 14341 states and 41686 transitions. [2019-12-18 12:34:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:34:44,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:44,692 INFO L225 Difference]: With dead ends: 14341 [2019-12-18 12:34:44,692 INFO L226 Difference]: Without dead ends: 13466 [2019-12-18 12:34:44,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13466 states. [2019-12-18 12:34:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13466 to 10927. [2019-12-18 12:34:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10927 states. [2019-12-18 12:34:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 32658 transitions. [2019-12-18 12:34:44,865 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 32658 transitions. Word has length 67 [2019-12-18 12:34:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:44,865 INFO L462 AbstractCegarLoop]: Abstraction has 10927 states and 32658 transitions. [2019-12-18 12:34:44,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 32658 transitions. [2019-12-18 12:34:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:44,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:44,877 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 12:34:44,877 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 12:34:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-18 12:34:44,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:44,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661003115] [2019-12-18 12:34:44,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:45,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661003115] [2019-12-18 12:34:45,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:45,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:45,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218247059] [2019-12-18 12:34:45,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:45,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:45,018 INFO L87 Difference]: Start difference. First operand 10927 states and 32658 transitions. Second operand 10 states. [2019-12-18 12:34:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:46,133 INFO L93 Difference]: Finished difference Result 13894 states and 40663 transitions. [2019-12-18 12:34:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:46,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:46,152 INFO L225 Difference]: With dead ends: 13894 [2019-12-18 12:34:46,152 INFO L226 Difference]: Without dead ends: 13523 [2019-12-18 12:34:46,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:34:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-18 12:34:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 10919. [2019-12-18 12:34:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-18 12:34:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 32632 transitions. [2019-12-18 12:34:46,336 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 32632 transitions. Word has length 67 [2019-12-18 12:34:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:46,337 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 32632 transitions. [2019-12-18 12:34:46,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 32632 transitions. [2019-12-18 12:34:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:46,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:46,349 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 12:34:46,349 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-18 12:34:46,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:46,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221294520] [2019-12-18 12:34:46,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:46,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221294520] [2019-12-18 12:34:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:46,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:34:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954618672] [2019-12-18 12:34:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:34:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:34:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:34:46,555 INFO L87 Difference]: Start difference. First operand 10919 states and 32632 transitions. Second operand 12 states. [2019-12-18 12:34:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:47,221 INFO L93 Difference]: Finished difference Result 13227 states and 38901 transitions. [2019-12-18 12:34:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:34:47,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:34:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:47,240 INFO L225 Difference]: With dead ends: 13227 [2019-12-18 12:34:47,240 INFO L226 Difference]: Without dead ends: 12814 [2019-12-18 12:34:47,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:34:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2019-12-18 12:34:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 10665. [2019-12-18 12:34:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-18 12:34:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 31988 transitions. [2019-12-18 12:34:47,418 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 31988 transitions. Word has length 67 [2019-12-18 12:34:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:47,418 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 31988 transitions. [2019-12-18 12:34:47,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:34:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 31988 transitions. [2019-12-18 12:34:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:47,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:47,429 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 12:34:47,430 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-18 12:34:47,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:47,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241525480] [2019-12-18 12:34:47,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:34:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:34:47,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:34:47,540 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:34:47,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= |v_ULTIMATE.start_main_~#t397~0.offset_22| 0) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t397~0.base_29|) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29|) 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29| 1)) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29|) |v_ULTIMATE.start_main_~#t397~0.offset_22| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t397~0.base_29| 4)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t397~0.offset=|v_ULTIMATE.start_main_~#t397~0.offset_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ULTIMATE.start_main_~#t397~0.base=|v_ULTIMATE.start_main_~#t397~0.base_29|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_15|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t398~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t397~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t397~0.base, ULTIMATE.start_main_~#t398~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t399~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:34:47,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12| 1) |v_#valid_34|) (not (= |v_ULTIMATE.start_main_~#t398~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t398~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t398~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t398~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12|) |v_ULTIMATE.start_main_~#t398~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t398~0.offset, #length] because there is no mapped edge [2019-12-18 12:34:47,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t399~0.base_13|)) (= |v_ULTIMATE.start_main_~#t399~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t399~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13|) |v_ULTIMATE.start_main_~#t399~0.offset_11| 2))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t399~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_~#t399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:34:47,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd0~0_In255327553 ~a$r_buff1_thd0~0_Out255327553) (= ~__unbuffered_p0_EAX~0_Out255327553 ~x~0_Out255327553) (= 1 ~a$r_buff0_thd1~0_Out255327553) (= ~__unbuffered_p0_EBX~0_Out255327553 ~y~0_In255327553) (= ~a$r_buff1_thd1~0_Out255327553 ~a$r_buff0_thd1~0_In255327553) (= ~a$r_buff0_thd2~0_In255327553 ~a$r_buff1_thd2~0_Out255327553) (= ~a$r_buff1_thd3~0_Out255327553 ~a$r_buff0_thd3~0_In255327553) (= 1 ~x~0_Out255327553) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In255327553))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In255327553, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In255327553, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In255327553, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In255327553, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In255327553, ~y~0=~y~0_In255327553} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out255327553, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out255327553, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out255327553, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out255327553, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In255327553, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In255327553, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out255327553, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In255327553, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out255327553, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out255327553, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In255327553, ~y~0=~y~0_In255327553, ~x~0=~x~0_Out255327553} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:34:47,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-649277623 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-649277623 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-649277623 |P0Thread1of1ForFork1_#t~ite5_Out-649277623|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-649277623|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-649277623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-649277623} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-649277623|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-649277623, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-649277623} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:34:47,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1134926030 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1134926030 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1134926030 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1134926030 256)))) (or (and (= ~a$w_buff1_used~0_In-1134926030 |P0Thread1of1ForFork1_#t~ite6_Out-1134926030|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1134926030|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1134926030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1134926030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1134926030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1134926030} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1134926030|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1134926030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1134926030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1134926030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1134926030} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:34:47,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1854237104 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1854237104 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1854237104| ~a$w_buff1~0_In-1854237104) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1854237104| ~a~0_In-1854237104)))) InVars {~a~0=~a~0_In-1854237104, ~a$w_buff1~0=~a$w_buff1~0_In-1854237104, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1854237104, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1854237104} OutVars{~a~0=~a~0_In-1854237104, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1854237104|, ~a$w_buff1~0=~a$w_buff1~0_In-1854237104, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1854237104, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1854237104} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:34:47,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:34:47,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In246330769 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In246330769 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out246330769 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out246330769 ~a$r_buff0_thd1~0_In246330769)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In246330769, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In246330769} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out246330769|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In246330769, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out246330769} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:34:47,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In593387870 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In593387870 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In593387870 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In593387870 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out593387870| ~a$r_buff1_thd1~0_In593387870) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out593387870| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In593387870, ~a$w_buff0_used~0=~a$w_buff0_used~0_In593387870, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In593387870, ~a$w_buff1_used~0=~a$w_buff1_used~0_In593387870} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out593387870|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In593387870, ~a$w_buff0_used~0=~a$w_buff0_used~0_In593387870, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In593387870, ~a$w_buff1_used~0=~a$w_buff1_used~0_In593387870} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:34:47,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:34:47,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1585566331 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1585566331 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1585566331|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1585566331 |P1Thread1of1ForFork2_#t~ite11_Out-1585566331|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1585566331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1585566331} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1585566331, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1585566331, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1585566331|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:34:47,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1077873557 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1077873557 256)))) (or (and .cse0 (= (mod ~a$w_buff1_used~0_In1077873557 256) 0)) (and (= 0 (mod ~a$r_buff1_thd3~0_In1077873557 256)) .cse0) (= (mod ~a$w_buff0_used~0_In1077873557 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out1077873557| ~a$w_buff0~0_In1077873557) (= |P2Thread1of1ForFork0_#t~ite20_Out1077873557| |P2Thread1of1ForFork0_#t~ite21_Out1077873557|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite20_In1077873557| |P2Thread1of1ForFork0_#t~ite20_Out1077873557|) (= |P2Thread1of1ForFork0_#t~ite21_Out1077873557| ~a$w_buff0~0_In1077873557) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1077873557, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1077873557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1077873557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1077873557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1077873557, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1077873557|, ~weak$$choice2~0=~weak$$choice2~0_In1077873557} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1077873557|, ~a$w_buff0~0=~a$w_buff0~0_In1077873557, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1077873557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1077873557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1077873557, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1077873557|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1077873557, ~weak$$choice2~0=~weak$$choice2~0_In1077873557} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:34:47,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1262410341 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1262410341| |P2Thread1of1ForFork0_#t~ite23_Out-1262410341|) (= ~a$w_buff1~0_In-1262410341 |P2Thread1of1ForFork0_#t~ite23_Out-1262410341|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1262410341 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1262410341 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-1262410341 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1262410341 256)) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In-1262410341| |P2Thread1of1ForFork0_#t~ite23_Out-1262410341|) (= ~a$w_buff1~0_In-1262410341 |P2Thread1of1ForFork0_#t~ite24_Out-1262410341|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1262410341, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1262410341|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262410341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262410341, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262410341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262410341, ~weak$$choice2~0=~weak$$choice2~0_In-1262410341} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1262410341, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1262410341|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1262410341|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262410341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262410341, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262410341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262410341, ~weak$$choice2~0=~weak$$choice2~0_In-1262410341} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:34:47,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1956243964 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1956243964 |P2Thread1of1ForFork0_#t~ite27_Out-1956243964|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1956243964| |P2Thread1of1ForFork0_#t~ite26_Out-1956243964|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1956243964 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1956243964 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-1956243964 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1956243964 256) 0)))) .cse0 (= ~a$w_buff0_used~0_In-1956243964 |P2Thread1of1ForFork0_#t~ite26_Out-1956243964|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1956243964| |P2Thread1of1ForFork0_#t~ite26_Out-1956243964|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1956243964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1956243964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1956243964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1956243964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1956243964, ~weak$$choice2~0=~weak$$choice2~0_In-1956243964} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1956243964|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1956243964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1956243964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1956243964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1956243964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1956243964, ~weak$$choice2~0=~weak$$choice2~0_In-1956243964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:34:47,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:34:47,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:34:47,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1823582678 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1823582678 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1823582678 |P2Thread1of1ForFork0_#t~ite38_Out1823582678|)) (and (or .cse0 .cse1) (= ~a~0_In1823582678 |P2Thread1of1ForFork0_#t~ite38_Out1823582678|)))) InVars {~a~0=~a~0_In1823582678, ~a$w_buff1~0=~a$w_buff1~0_In1823582678, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1823582678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1823582678} OutVars{~a~0=~a~0_In1823582678, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1823582678|, ~a$w_buff1~0=~a$w_buff1~0_In1823582678, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1823582678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1823582678} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:34:47,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:34:47,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-664829259 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-664829259 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-664829259|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-664829259 |P2Thread1of1ForFork0_#t~ite40_Out-664829259|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-664829259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-664829259} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-664829259|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-664829259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-664829259} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:34:47,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-1965924383 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1965924383 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1965924383 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1965924383 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1965924383|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-1965924383 |P2Thread1of1ForFork0_#t~ite41_Out-1965924383|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1965924383, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1965924383, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1965924383, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1965924383} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1965924383, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1965924383, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1965924383, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1965924383, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1965924383|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:34:47,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1512895703 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1512895703 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1512895703|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1512895703| ~a$r_buff0_thd3~0_In-1512895703) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1512895703, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1512895703} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1512895703, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1512895703, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1512895703|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:34:47,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In39804885 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In39804885 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In39804885 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In39804885 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out39804885| ~a$r_buff1_thd3~0_In39804885) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out39804885| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In39804885, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39804885, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In39804885, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39804885} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out39804885|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In39804885, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39804885, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In39804885, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39804885} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:34:47,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In408356864 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In408356864 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In408356864 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In408356864 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out408356864|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In408356864 |P1Thread1of1ForFork2_#t~ite12_Out408356864|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In408356864, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In408356864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In408356864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In408356864} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In408356864, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In408356864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In408356864, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out408356864|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In408356864} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:34:47,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In120170728 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In120170728 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out120170728| 0)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out120170728| ~a$r_buff0_thd2~0_In120170728) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In120170728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In120170728} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In120170728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In120170728, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out120170728|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:34:47,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1527444238 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1527444238 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1527444238 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1527444238 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1527444238| ~a$r_buff1_thd2~0_In-1527444238) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1527444238| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1527444238, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1527444238, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1527444238, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1527444238} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1527444238, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1527444238, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1527444238, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1527444238, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1527444238|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:34:47,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:34:47,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:34:47,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:34:47,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In72388116 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In72388116 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out72388116| ~a~0_In72388116) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out72388116| ~a$w_buff1~0_In72388116)))) InVars {~a~0=~a~0_In72388116, ~a$w_buff1~0=~a$w_buff1~0_In72388116, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In72388116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In72388116} OutVars{~a~0=~a~0_In72388116, ~a$w_buff1~0=~a$w_buff1~0_In72388116, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out72388116|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In72388116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In72388116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:34:47,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:34:47,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1157535485 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1157535485 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1157535485| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1157535485| ~a$w_buff0_used~0_In-1157535485) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1157535485, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1157535485} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1157535485, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1157535485|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1157535485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:34:47,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In618374596 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In618374596 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In618374596 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In618374596 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out618374596| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In618374596 |ULTIMATE.start_main_#t~ite50_Out618374596|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In618374596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In618374596, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In618374596, ~a$w_buff1_used~0=~a$w_buff1_used~0_In618374596} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out618374596|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In618374596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In618374596, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In618374596, ~a$w_buff1_used~0=~a$w_buff1_used~0_In618374596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:34:47,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In223237536 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In223237536 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out223237536| ~a$r_buff0_thd0~0_In223237536)) (and (= |ULTIMATE.start_main_#t~ite51_Out223237536| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In223237536, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In223237536} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out223237536|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In223237536, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In223237536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:34:47,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1028942405 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In1028942405 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1028942405 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1028942405 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1028942405| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out1028942405| ~a$r_buff1_thd0~0_In1028942405) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1028942405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1028942405, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1028942405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1028942405} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1028942405|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1028942405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1028942405, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1028942405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1028942405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:34:47,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:34:47,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:34:47 BasicIcfg [2019-12-18 12:34:47,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:34:47,706 INFO L168 Benchmark]: Toolchain (without parser) took 111702.50 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,706 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:34:47,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.64 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,707 INFO L168 Benchmark]: Boogie Preprocessor took 62.81 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,708 INFO L168 Benchmark]: RCFGBuilder took 904.59 ms. Allocated memory is still 204.5 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,708 INFO L168 Benchmark]: TraceAbstraction took 109949.76 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:34:47,710 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.24 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.64 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.81 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 904.59 ms. Allocated memory is still 204.5 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109949.76 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.6s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8931 SDtfs, 13969 SDslu, 30445 SDs, 0 SdLazy, 16321 SolverSat, 719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 82 SyntacticMatches, 28 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred 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: 39.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 243346 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1903 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1797 ConstructedInterpolants, 0 QuantifiedInterpolants, 390876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...