/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/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:35:20,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:35:20,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:35:20,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:35:20,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:35:20,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:35:20,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:35:20,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:35:20,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:35:20,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:35:20,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:35:20,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:35:20,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:35:20,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:35:20,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:35:20,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:35:20,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:35:20,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:35:20,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:35:20,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:35:20,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:35:20,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:35:20,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:35:20,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:35:20,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:35:20,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:35:20,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:35:20,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:35:20,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:35:20,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:35:20,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:35:20,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:35:20,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:35:20,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:35:20,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:35:20,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:35:20,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:35:20,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:35:20,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:35:20,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:35:20,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:35:20,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:35:20,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:35:20,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:35:20,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:35:20,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:35:20,817 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:35:20,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:35:20,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:35:20,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:35:20,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:35:20,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:35:20,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:35:20,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:35:20,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:35:20,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:35:20,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:35:20,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:35:20,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:20,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:35:20,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:35:20,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:35:20,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:35:20,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:35:20,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:35:20,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:35:20,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:35:21,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:35:21,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:35:21,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:35:21,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:35:21,142 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:35:21,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-26 22:35:21,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84297b31c/98412e000f48465785d51e6fb5ac886e/FLAGff0b92224 [2019-12-26 22:35:21,777 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:35:21,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-26 22:35:21,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84297b31c/98412e000f48465785d51e6fb5ac886e/FLAGff0b92224 [2019-12-26 22:35:22,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84297b31c/98412e000f48465785d51e6fb5ac886e [2019-12-26 22:35:22,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:35:22,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:35:22,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:22,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:35:22,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:35:22,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:22,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4419eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22, skipping insertion in model container [2019-12-26 22:35:22,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:22,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:35:22,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:35:22,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:22,820 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:35:22,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:22,972 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:35:22,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22 WrapperNode [2019-12-26 22:35:22,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:22,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:22,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:35:22,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:35:22,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:23,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:35:23,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:35:23,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:35:23,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... [2019-12-26 22:35:23,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:35:23,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:35:23,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:35:23,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:35:23,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:35:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:35:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:35:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:35:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:35:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:35:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:35:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:35:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:35:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:35:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:35:23,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:35:23,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:35:23,176 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:35:23,948 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:35:23,949 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:35:23,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:23 BoogieIcfgContainer [2019-12-26 22:35:23,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:35:23,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:35:23,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:35:23,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:35:23,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:35:22" (1/3) ... [2019-12-26 22:35:23,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9574e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:23, skipping insertion in model container [2019-12-26 22:35:23,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:22" (2/3) ... [2019-12-26 22:35:23,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9574e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:23, skipping insertion in model container [2019-12-26 22:35:23,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:23" (3/3) ... [2019-12-26 22:35:23,960 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-26 22:35:23,971 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:35:23,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:35:23,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:35:23,981 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:35:24,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,025 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,025 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,025 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,103 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:24,147 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:35:24,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:35:24,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:35:24,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:35:24,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:35:24,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:35:24,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:35:24,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:35:24,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:35:24,193 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 22:35:24,194 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:35:24,305 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:35:24,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:24,327 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:35:24,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:35:24,418 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:35:24,418 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:24,427 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:35:24,450 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:35:24,452 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:35:29,972 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:35:30,276 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:35:30,399 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:35:30,426 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-26 22:35:30,426 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 22:35:30,430 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:35:45,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-26 22:35:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-26 22:35:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:35:45,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:45,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:35:45,051 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-26 22:35:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-26 22:35:45,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:45,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725776124] [2019-12-26 22:35:45,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725776124] [2019-12-26 22:35:45,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:45,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:35:45,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699670739] [2019-12-26 22:35:45,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:45,292 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-26 22:35:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:48,779 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-26 22:35:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:48,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:35:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:49,368 INFO L225 Difference]: With dead ends: 101544 [2019-12-26 22:35:49,368 INFO L226 Difference]: Without dead ends: 95304 [2019-12-26 22:35:49,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-26 22:35:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-26 22:35:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-26 22:36:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-26 22:36:00,684 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-26 22:36:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:00,684 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-26 22:36:00,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-26 22:36:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:36:00,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:00,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:00,689 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-26 22:36:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-26 22:36:00,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:00,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854389768] [2019-12-26 22:36:00,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:00,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854389768] [2019-12-26 22:36:00,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:00,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:00,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274079919] [2019-12-26 22:36:00,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:00,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:00,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:00,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:00,800 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-26 22:36:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:01,945 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-26 22:36:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:01,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:36:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:06,758 INFO L225 Difference]: With dead ends: 152040 [2019-12-26 22:36:06,759 INFO L226 Difference]: Without dead ends: 151991 [2019-12-26 22:36:06,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-26 22:36:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-26 22:36:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-26 22:36:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-26 22:36:14,291 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-26 22:36:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:14,292 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-26 22:36:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-26 22:36:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:36:14,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:14,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:14,299 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-26 22:36:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-26 22:36:14,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:14,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932971883] [2019-12-26 22:36:14,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:14,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932971883] [2019-12-26 22:36:14,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:14,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:14,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538042920] [2019-12-26 22:36:14,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:14,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:14,366 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-26 22:36:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:14,485 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-26 22:36:14,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:14,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:36:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:14,547 INFO L225 Difference]: With dead ends: 30915 [2019-12-26 22:36:14,547 INFO L226 Difference]: Without dead ends: 30915 [2019-12-26 22:36:14,548 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-26 22:36:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-26 22:36:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-26 22:36:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-26 22:36:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-26 22:36:15,217 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-26 22:36:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:15,217 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-26 22:36:15,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-26 22:36:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:36:15,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:15,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:15,220 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-26 22:36:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-26 22:36:15,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:15,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060649980] [2019-12-26 22:36:15,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:15,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060649980] [2019-12-26 22:36:15,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:15,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:15,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675792461] [2019-12-26 22:36:15,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:15,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:15,353 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-26 22:36:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:15,676 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-26 22:36:15,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:15,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:36:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:15,747 INFO L225 Difference]: With dead ends: 38538 [2019-12-26 22:36:15,747 INFO L226 Difference]: Without dead ends: 38538 [2019-12-26 22:36:15,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-26 22:36:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-26 22:36:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-26 22:36:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-26 22:36:17,988 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-26 22:36:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:17,989 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-26 22:36:17,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-26 22:36:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:36:17,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:17,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:17,998 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-26 22:36:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-26 22:36:17,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99362558] [2019-12-26 22:36:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:18,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99362558] [2019-12-26 22:36:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:18,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756310905] [2019-12-26 22:36:18,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:18,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:18,147 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-26 22:36:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:18,736 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-26 22:36:18,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:18,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:36:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:18,804 INFO L225 Difference]: With dead ends: 44779 [2019-12-26 22:36:18,805 INFO L226 Difference]: Without dead ends: 44772 [2019-12-26 22:36:18,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-26 22:36:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-26 22:36:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-26 22:36:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-26 22:36:19,913 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-26 22:36:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:19,913 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-26 22:36:19,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-26 22:36:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:36:19,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:19,925 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-26 22:36:19,925 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-26 22:36:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-26 22:36:19,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:19,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468093002] [2019-12-26 22:36:19,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:20,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468093002] [2019-12-26 22:36:20,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:20,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:20,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027538159] [2019-12-26 22:36:20,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:20,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:20,013 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-26 22:36:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:20,076 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-26 22:36:20,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:36:20,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:36:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:20,100 INFO L225 Difference]: With dead ends: 13768 [2019-12-26 22:36:20,100 INFO L226 Difference]: Without dead ends: 13768 [2019-12-26 22:36:20,100 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-26 22:36:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-26 22:36:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-26 22:36:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-26 22:36:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-26 22:36:20,298 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-26 22:36:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:20,298 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-26 22:36:20,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-26 22:36:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:20,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:20,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:20,308 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-26 22:36:20,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-26 22:36:20,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:20,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109734888] [2019-12-26 22:36:20,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:20,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109734888] [2019-12-26 22:36:20,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:20,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:20,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416578796] [2019-12-26 22:36:20,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:20,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:20,360 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-26 22:36:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:20,465 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-26 22:36:20,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:20,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:36:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:20,497 INFO L225 Difference]: With dead ends: 19309 [2019-12-26 22:36:20,497 INFO L226 Difference]: Without dead ends: 19309 [2019-12-26 22:36:20,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-26 22:36:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-26 22:36:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-26 22:36:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-26 22:36:20,740 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-26 22:36:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:20,741 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-26 22:36:20,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-26 22:36:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:20,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:20,750 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-26 22:36:20,750 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-26 22:36:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-26 22:36:20,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:20,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846450840] [2019-12-26 22:36:20,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:20,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846450840] [2019-12-26 22:36:20,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:20,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:20,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154081433] [2019-12-26 22:36:20,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:20,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:20,793 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-26 22:36:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:20,884 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-26 22:36:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:20,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:36:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:20,913 INFO L225 Difference]: With dead ends: 21037 [2019-12-26 22:36:20,913 INFO L226 Difference]: Without dead ends: 21037 [2019-12-26 22:36:20,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-26 22:36:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-26 22:36:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-26 22:36:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-26 22:36:21,180 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-26 22:36:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:21,181 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-26 22:36:21,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-26 22:36:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:21,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:21,193 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-26 22:36:21,193 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-26 22:36:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-26 22:36:21,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:21,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072800353] [2019-12-26 22:36:21,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:21,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072800353] [2019-12-26 22:36:21,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:21,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:21,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629625216] [2019-12-26 22:36:21,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:21,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:21,289 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-26 22:36:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:21,939 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-26 22:36:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:21,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:36:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:21,999 INFO L225 Difference]: With dead ends: 29609 [2019-12-26 22:36:21,999 INFO L226 Difference]: Without dead ends: 29609 [2019-12-26 22:36:21,999 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-26 22:36:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-26 22:36:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-26 22:36:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-26 22:36:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-26 22:36:22,613 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-26 22:36:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:22,614 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-26 22:36:22,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-26 22:36:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:36:22,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:22,627 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-26 22:36:22,627 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-26 22:36:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-26 22:36:22,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:22,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664778900] [2019-12-26 22:36:22,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:22,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664778900] [2019-12-26 22:36:22,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:22,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:22,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123409619] [2019-12-26 22:36:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:22,741 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-26 22:36:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:23,327 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-26 22:36:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:23,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:36:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:23,381 INFO L225 Difference]: With dead ends: 28968 [2019-12-26 22:36:23,381 INFO L226 Difference]: Without dead ends: 28968 [2019-12-26 22:36:23,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-26 22:36:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-26 22:36:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-26 22:36:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-26 22:36:23,863 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-26 22:36:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:23,863 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-26 22:36:23,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-26 22:36:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:36:23,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:23,889 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-26 22:36:23,889 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-26 22:36:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-26 22:36:23,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:23,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472777659] [2019-12-26 22:36:23,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:23,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472777659] [2019-12-26 22:36:23,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:23,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:23,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504757144] [2019-12-26 22:36:23,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:23,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:23,997 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-26 22:36:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:25,108 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-26 22:36:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:36:25,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:36:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:25,186 INFO L225 Difference]: With dead ends: 38372 [2019-12-26 22:36:25,186 INFO L226 Difference]: Without dead ends: 38372 [2019-12-26 22:36:25,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:36:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-26 22:36:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-26 22:36:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-26 22:36:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-26 22:36:25,629 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-26 22:36:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:25,629 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-26 22:36:25,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-26 22:36:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:36:25,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:25,939 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-26 22:36:25,939 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-26 22:36:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-26 22:36:25,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:25,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658703876] [2019-12-26 22:36:25,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:26,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658703876] [2019-12-26 22:36:26,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:26,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:26,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841308019] [2019-12-26 22:36:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:26,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:26,113 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-26 22:36:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:27,852 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-26 22:36:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:36:27,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 22:36:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:27,915 INFO L225 Difference]: With dead ends: 45317 [2019-12-26 22:36:27,915 INFO L226 Difference]: Without dead ends: 45317 [2019-12-26 22:36:27,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:36:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-26 22:36:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-26 22:36:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-26 22:36:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-26 22:36:28,363 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-26 22:36:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:28,363 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-26 22:36:28,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-26 22:36:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:28,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:28,380 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-26 22:36:28,380 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-26 22:36:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-26 22:36:28,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:28,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833705961] [2019-12-26 22:36:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:28,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833705961] [2019-12-26 22:36:28,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:28,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:28,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076893761] [2019-12-26 22:36:28,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:28,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:28,505 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-26 22:36:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:29,799 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-26 22:36:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:36:29,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:36:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:29,861 INFO L225 Difference]: With dead ends: 34977 [2019-12-26 22:36:29,861 INFO L226 Difference]: Without dead ends: 34977 [2019-12-26 22:36:29,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:36:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-26 22:36:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-26 22:36:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-26 22:36:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-26 22:36:30,535 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-26 22:36:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:30,535 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-26 22:36:30,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-26 22:36:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:30,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:30,551 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-26 22:36:30,552 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-26 22:36:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-26 22:36:30,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:30,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691567377] [2019-12-26 22:36:30,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:30,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691567377] [2019-12-26 22:36:30,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:30,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:30,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316413076] [2019-12-26 22:36:30,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:30,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:30,646 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-26 22:36:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:31,894 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-26 22:36:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:36:31,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:36:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:31,957 INFO L225 Difference]: With dead ends: 43257 [2019-12-26 22:36:31,957 INFO L226 Difference]: Without dead ends: 43257 [2019-12-26 22:36:31,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:36:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-26 22:36:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-26 22:36:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-26 22:36:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-26 22:36:32,391 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-26 22:36:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:32,391 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-26 22:36:32,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-26 22:36:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:32,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:32,408 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-26 22:36:32,408 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-26 22:36:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:32,408 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-26 22:36:32,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:32,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746026160] [2019-12-26 22:36:32,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746026160] [2019-12-26 22:36:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:32,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816404697] [2019-12-26 22:36:32,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:32,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:32,551 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-26 22:36:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:34,110 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-26 22:36:34,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:36:34,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-26 22:36:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:34,183 INFO L225 Difference]: With dead ends: 39307 [2019-12-26 22:36:34,183 INFO L226 Difference]: Without dead ends: 39307 [2019-12-26 22:36:34,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:36:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-26 22:36:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-26 22:36:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-26 22:36:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-26 22:36:34,975 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-26 22:36:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:34,975 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-26 22:36:34,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-26 22:36:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:36:34,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:34,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:34,997 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-26 22:36:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-26 22:36:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:34,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780144730] [2019-12-26 22:36:34,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780144730] [2019-12-26 22:36:35,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:35,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:35,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110121182] [2019-12-26 22:36:35,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:35,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:35,050 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-26 22:36:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:35,121 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-26 22:36:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:35,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:36:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:35,153 INFO L225 Difference]: With dead ends: 16672 [2019-12-26 22:36:35,153 INFO L226 Difference]: Without dead ends: 16672 [2019-12-26 22:36:35,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-26 22:36:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-26 22:36:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-26 22:36:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-26 22:36:35,426 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-26 22:36:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:35,426 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-26 22:36:35,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-26 22:36:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:36:35,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:35,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:35,447 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-26 22:36:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-26 22:36:35,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:35,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785869962] [2019-12-26 22:36:35,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:35,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785869962] [2019-12-26 22:36:35,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:35,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:35,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910114444] [2019-12-26 22:36:35,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:35,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:35,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:35,515 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-26 22:36:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:36,149 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-26 22:36:36,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:36:36,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:36:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:36,190 INFO L225 Difference]: With dead ends: 27362 [2019-12-26 22:36:36,190 INFO L226 Difference]: Without dead ends: 27362 [2019-12-26 22:36:36,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-26 22:36:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-26 22:36:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-26 22:36:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-26 22:36:36,557 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-26 22:36:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:36,558 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-26 22:36:36,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-26 22:36:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:36:36,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:36,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:36,582 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-26 22:36:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-26 22:36:36,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:36,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411082165] [2019-12-26 22:36:36,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:36,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411082165] [2019-12-26 22:36:36,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:36,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:36,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190728111] [2019-12-26 22:36:36,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:36,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:36,639 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-26 22:36:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:36,743 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-26 22:36:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:36,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:36:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:36,773 INFO L225 Difference]: With dead ends: 20430 [2019-12-26 22:36:36,773 INFO L226 Difference]: Without dead ends: 20430 [2019-12-26 22:36:36,773 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-26 22:36:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-26 22:36:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-26 22:36:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-26 22:36:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-26 22:36:37,084 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-26 22:36:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:37,085 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-26 22:36:37,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-26 22:36:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:37,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:37,108 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-26 22:36:37,108 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-26 22:36:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-26 22:36:37,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:37,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193108362] [2019-12-26 22:36:37,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:37,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193108362] [2019-12-26 22:36:37,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:37,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:36:37,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979276400] [2019-12-26 22:36:37,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:37,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:37,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:37,217 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-26 22:36:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:38,633 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-26 22:36:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:36:38,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 22:36:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:38,720 INFO L225 Difference]: With dead ends: 91773 [2019-12-26 22:36:38,720 INFO L226 Difference]: Without dead ends: 65597 [2019-12-26 22:36:38,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:36:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-26 22:36:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-26 22:36:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-26 22:36:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-26 22:36:39,369 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-26 22:36:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:39,370 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-26 22:36:39,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-26 22:36:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:39,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:39,396 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-26 22:36:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-26 22:36:39,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:39,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938849248] [2019-12-26 22:36:39,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:39,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938849248] [2019-12-26 22:36:39,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:39,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:39,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877587945] [2019-12-26 22:36:39,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:39,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:39,484 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-26 22:36:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:40,098 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-26 22:36:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:36:40,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:36:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:40,162 INFO L225 Difference]: With dead ends: 62216 [2019-12-26 22:36:40,162 INFO L226 Difference]: Without dead ends: 45804 [2019-12-26 22:36:40,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:36:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-26 22:36:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-26 22:36:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-26 22:36:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-26 22:36:40,720 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-26 22:36:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:40,720 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-26 22:36:40,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-26 22:36:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:40,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:40,750 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-26 22:36:40,750 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-26 22:36:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-26 22:36:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:40,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919414941] [2019-12-26 22:36:40,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:40,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919414941] [2019-12-26 22:36:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:40,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:36:40,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529849875] [2019-12-26 22:36:40,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:36:40,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:36:40,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:40,866 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-26 22:36:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:42,537 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-26 22:36:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:36:42,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:36:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:42,697 INFO L225 Difference]: With dead ends: 113274 [2019-12-26 22:36:42,698 INFO L226 Difference]: Without dead ends: 108630 [2019-12-26 22:36:42,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:36:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-26 22:36:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-26 22:36:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-26 22:36:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-26 22:36:43,767 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-26 22:36:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:43,767 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-26 22:36:43,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:36:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-26 22:36:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:43,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:43,798 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-26 22:36:43,798 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-26 22:36:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-26 22:36:43,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:43,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862287792] [2019-12-26 22:36:43,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:43,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862287792] [2019-12-26 22:36:43,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:43,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:36:43,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513059608] [2019-12-26 22:36:43,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:36:43,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:36:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:43,896 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-26 22:36:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:45,673 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-26 22:36:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:36:45,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:36:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:45,793 INFO L225 Difference]: With dead ends: 91424 [2019-12-26 22:36:45,794 INFO L226 Difference]: Without dead ends: 87972 [2019-12-26 22:36:45,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:36:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-26 22:36:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-26 22:36:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-26 22:36:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-26 22:36:46,672 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-26 22:36:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:46,672 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-26 22:36:46,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:36:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-26 22:36:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:46,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:46,700 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-26 22:36:46,700 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-26 22:36:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-26 22:36:46,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:46,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099823474] [2019-12-26 22:36:46,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:46,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099823474] [2019-12-26 22:36:46,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:46,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:46,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908783872] [2019-12-26 22:36:46,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:46,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:46,780 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-26 22:36:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:47,288 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-26 22:36:47,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:36:47,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:36:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:47,398 INFO L225 Difference]: With dead ends: 58989 [2019-12-26 22:36:47,398 INFO L226 Difference]: Without dead ends: 49515 [2019-12-26 22:36:47,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:36:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-26 22:36:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-26 22:36:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-26 22:36:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-26 22:36:48,555 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-26 22:36:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:48,555 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-26 22:36:48,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-26 22:36:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:48,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:48,588 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-26 22:36:48,588 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-26 22:36:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-26 22:36:48,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:48,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560042544] [2019-12-26 22:36:48,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560042544] [2019-12-26 22:36:48,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:48,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:36:48,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405791567] [2019-12-26 22:36:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:48,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:48,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:48,686 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-26 22:36:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:50,269 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-26 22:36:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:36:50,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:36:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:50,343 INFO L225 Difference]: With dead ends: 52488 [2019-12-26 22:36:50,343 INFO L226 Difference]: Without dead ends: 52488 [2019-12-26 22:36:50,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:36:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-26 22:36:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-26 22:36:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 22:36:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-26 22:36:50,971 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-26 22:36:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:50,971 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-26 22:36:50,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-26 22:36:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:51,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:51,003 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-26 22:36:51,004 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-26 22:36:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-26 22:36:51,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:51,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835768856] [2019-12-26 22:36:51,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:51,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835768856] [2019-12-26 22:36:51,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:51,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:36:51,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868754803] [2019-12-26 22:36:51,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:51,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:51,132 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-26 22:36:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:53,035 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-26 22:36:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:36:53,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 22:36:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:53,116 INFO L225 Difference]: With dead ends: 56163 [2019-12-26 22:36:53,116 INFO L226 Difference]: Without dead ends: 56163 [2019-12-26 22:36:53,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:36:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-26 22:36:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-26 22:36:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-26 22:36:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-26 22:36:54,153 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-26 22:36:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:54,153 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-26 22:36:54,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-26 22:36:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:36:54,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:54,185 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-26 22:36:54,186 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-26 22:36:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-26 22:36:54,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:54,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892598261] [2019-12-26 22:36:54,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:54,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892598261] [2019-12-26 22:36:54,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:54,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:54,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322328650] [2019-12-26 22:36:54,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:54,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:54,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:54,250 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-26 22:36:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:54,467 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-26 22:36:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:54,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:36:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:54,543 INFO L225 Difference]: With dead ends: 32830 [2019-12-26 22:36:54,543 INFO L226 Difference]: Without dead ends: 32830 [2019-12-26 22:36:54,544 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-26 22:36:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-26 22:36:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-26 22:36:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-26 22:36:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-26 22:36:55,145 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-26 22:36:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:55,145 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-26 22:36:55,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-26 22:36:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:36:55,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:55,177 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-26 22:36:55,177 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-26 22:36:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:55,178 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-26 22:36:55,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:55,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014568023] [2019-12-26 22:36:55,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:55,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014568023] [2019-12-26 22:36:55,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:55,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:55,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010535294] [2019-12-26 22:36:55,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:55,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:55,221 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-26 22:36:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:55,478 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-26 22:36:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:36:55,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:36:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:55,528 INFO L225 Difference]: With dead ends: 36066 [2019-12-26 22:36:55,528 INFO L226 Difference]: Without dead ends: 36066 [2019-12-26 22:36:55,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 22:36:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-26 22:36:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-26 22:36:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-26 22:36:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-26 22:36:56,016 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-26 22:36:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:56,017 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-26 22:36:56,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-26 22:36:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:36:56,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:56,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:56,047 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-26 22:36:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-26 22:36:56,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:56,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718529062] [2019-12-26 22:36:56,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:56,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718529062] [2019-12-26 22:36:56,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:56,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:36:56,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276474187] [2019-12-26 22:36:56,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:56,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:56,147 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-26 22:36:57,177 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-26 22:36:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:57,416 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-26 22:36:57,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:36:57,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:36:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:57,520 INFO L225 Difference]: With dead ends: 80928 [2019-12-26 22:36:57,520 INFO L226 Difference]: Without dead ends: 74194 [2019-12-26 22:36:57,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:36:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-26 22:36:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-26 22:36:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-26 22:36:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-26 22:36:58,326 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-26 22:36:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:58,326 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-26 22:36:58,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-26 22:36:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:36:58,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:58,358 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-26 22:36:58,358 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-26 22:36:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-26 22:36:58,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:58,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056696706] [2019-12-26 22:36:58,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:58,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056696706] [2019-12-26 22:36:58,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:58,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:58,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163170543] [2019-12-26 22:36:58,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:58,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:58,408 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-26 22:36:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:58,729 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-26 22:36:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:58,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:36:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:58,796 INFO L225 Difference]: With dead ends: 45778 [2019-12-26 22:36:58,797 INFO L226 Difference]: Without dead ends: 45778 [2019-12-26 22:36:58,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-26 22:36:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-26 22:36:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-26 22:36:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-26 22:36:59,376 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-26 22:36:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:59,376 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-26 22:36:59,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-26 22:36:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:36:59,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:59,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:59,410 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-26 22:36:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-26 22:36:59,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:59,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463594531] [2019-12-26 22:36:59,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:59,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463594531] [2019-12-26 22:36:59,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:59,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:36:59,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213839302] [2019-12-26 22:36:59,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:36:59,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:36:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:59,523 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-26 22:37:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:01,292 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-26 22:37:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:37:01,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:01,426 INFO L225 Difference]: With dead ends: 103839 [2019-12-26 22:37:01,426 INFO L226 Difference]: Without dead ends: 93795 [2019-12-26 22:37:01,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:37:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-26 22:37:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-26 22:37:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-26 22:37:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-26 22:37:02,395 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-26 22:37:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:02,395 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-26 22:37:02,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-26 22:37:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:02,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:02,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:02,430 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-26 22:37:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-26 22:37:02,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:02,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156648878] [2019-12-26 22:37:02,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:02,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156648878] [2019-12-26 22:37:02,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:02,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:02,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679263493] [2019-12-26 22:37:02,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:02,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:02,539 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-26 22:37:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:03,768 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-26 22:37:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:37:03,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:03,888 INFO L225 Difference]: With dead ends: 88943 [2019-12-26 22:37:03,889 INFO L226 Difference]: Without dead ends: 84511 [2019-12-26 22:37:03,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:37:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-26 22:37:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-26 22:37:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-26 22:37:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-26 22:37:05,212 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-26 22:37:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:05,213 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-26 22:37:05,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-26 22:37:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:05,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:05,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:05,249 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-26 22:37:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-26 22:37:05,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:05,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601337038] [2019-12-26 22:37:05,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:05,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601337038] [2019-12-26 22:37:05,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:05,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:05,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518947635] [2019-12-26 22:37:05,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:05,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:05,361 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-26 22:37:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:06,850 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-26 22:37:06,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:37:06,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:37:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:06,931 INFO L225 Difference]: With dead ends: 50821 [2019-12-26 22:37:06,931 INFO L226 Difference]: Without dead ends: 50821 [2019-12-26 22:37:06,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:37:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-26 22:37:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-26 22:37:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-26 22:37:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-26 22:37:07,560 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-26 22:37:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:07,560 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-26 22:37:07,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-26 22:37:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:07,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:07,594 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-26 22:37:07,595 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-26 22:37:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-26 22:37:07,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:07,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352377153] [2019-12-26 22:37:07,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:07,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352377153] [2019-12-26 22:37:07,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:07,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:07,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124302100] [2019-12-26 22:37:07,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:07,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:07,664 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-26 22:37:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:08,448 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-26 22:37:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:37:08,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 22:37:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:08,533 INFO L225 Difference]: With dead ends: 41644 [2019-12-26 22:37:08,533 INFO L226 Difference]: Without dead ends: 41400 [2019-12-26 22:37:08,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-26 22:37:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-26 22:37:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-26 22:37:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-26 22:37:09,520 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-26 22:37:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:09,520 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-26 22:37:09,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-26 22:37:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:09,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:09,558 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-26 22:37:09,558 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-26 22:37:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-26 22:37:09,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:09,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997347817] [2019-12-26 22:37:09,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:09,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997347817] [2019-12-26 22:37:09,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:09,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:09,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910324209] [2019-12-26 22:37:09,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:09,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:09,616 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-26 22:37:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:09,893 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-26 22:37:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:37:09,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:37:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:09,992 INFO L225 Difference]: With dead ends: 36756 [2019-12-26 22:37:09,992 INFO L226 Difference]: Without dead ends: 36756 [2019-12-26 22:37:09,993 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-26 22:37:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-26 22:37:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-26 22:37:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-26 22:37:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-26 22:37:10,935 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-26 22:37:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:10,935 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-26 22:37:10,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-26 22:37:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:10,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:10,989 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-26 22:37:10,989 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-26 22:37:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-26 22:37:10,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:10,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588766394] [2019-12-26 22:37:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:11,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588766394] [2019-12-26 22:37:11,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:11,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:37:11,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712163532] [2019-12-26 22:37:11,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:37:11,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:37:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:37:11,176 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 10 states. [2019-12-26 22:37:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:13,210 INFO L93 Difference]: Finished difference Result 53357 states and 158647 transitions. [2019-12-26 22:37:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:37:13,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 22:37:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:13,283 INFO L225 Difference]: With dead ends: 53357 [2019-12-26 22:37:13,283 INFO L226 Difference]: Without dead ends: 53357 [2019-12-26 22:37:13,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:37:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53357 states. [2019-12-26 22:37:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53357 to 33311. [2019-12-26 22:37:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33311 states. [2019-12-26 22:37:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33311 states to 33311 states and 100145 transitions. [2019-12-26 22:37:13,944 INFO L78 Accepts]: Start accepts. Automaton has 33311 states and 100145 transitions. Word has length 65 [2019-12-26 22:37:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:13,944 INFO L462 AbstractCegarLoop]: Abstraction has 33311 states and 100145 transitions. [2019-12-26 22:37:13,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:37:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33311 states and 100145 transitions. [2019-12-26 22:37:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:14,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:14,368 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-26 22:37:14,369 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-26 22:37:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-26 22:37:14,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:14,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549338712] [2019-12-26 22:37:14,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:14,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549338712] [2019-12-26 22:37:14,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:14,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:37:14,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389167850] [2019-12-26 22:37:14,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:14,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:14,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:14,520 INFO L87 Difference]: Start difference. First operand 33311 states and 100145 transitions. Second operand 9 states. [2019-12-26 22:37:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:16,605 INFO L93 Difference]: Finished difference Result 63201 states and 186948 transitions. [2019-12-26 22:37:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:37:16,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:16,690 INFO L225 Difference]: With dead ends: 63201 [2019-12-26 22:37:16,690 INFO L226 Difference]: Without dead ends: 62949 [2019-12-26 22:37:16,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-12-26 22:37:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62949 states. [2019-12-26 22:37:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62949 to 36043. [2019-12-26 22:37:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36043 states. [2019-12-26 22:37:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36043 states to 36043 states and 108060 transitions. [2019-12-26 22:37:17,453 INFO L78 Accepts]: Start accepts. Automaton has 36043 states and 108060 transitions. Word has length 65 [2019-12-26 22:37:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:17,453 INFO L462 AbstractCegarLoop]: Abstraction has 36043 states and 108060 transitions. [2019-12-26 22:37:17,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 36043 states and 108060 transitions. [2019-12-26 22:37:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:17,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:17,497 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-26 22:37:17,497 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-26 22:37:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 4 times [2019-12-26 22:37:17,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:17,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390513319] [2019-12-26 22:37:17,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:17,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390513319] [2019-12-26 22:37:17,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:37:17,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432810599] [2019-12-26 22:37:17,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:17,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:17,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:17,613 INFO L87 Difference]: Start difference. First operand 36043 states and 108060 transitions. Second operand 9 states. [2019-12-26 22:37:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:20,387 INFO L93 Difference]: Finished difference Result 64167 states and 189672 transitions. [2019-12-26 22:37:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 22:37:20,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:20,479 INFO L225 Difference]: With dead ends: 64167 [2019-12-26 22:37:20,480 INFO L226 Difference]: Without dead ends: 64167 [2019-12-26 22:37:20,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=1170, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 22:37:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64167 states. [2019-12-26 22:37:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64167 to 36271. [2019-12-26 22:37:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36271 states. [2019-12-26 22:37:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36271 states to 36271 states and 108406 transitions. [2019-12-26 22:37:21,610 INFO L78 Accepts]: Start accepts. Automaton has 36271 states and 108406 transitions. Word has length 65 [2019-12-26 22:37:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:21,610 INFO L462 AbstractCegarLoop]: Abstraction has 36271 states and 108406 transitions. [2019-12-26 22:37:21,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 36271 states and 108406 transitions. [2019-12-26 22:37:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:21,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:21,649 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-26 22:37:21,649 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-26 22:37:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1095461897, now seen corresponding path program 5 times [2019-12-26 22:37:21,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:21,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830728362] [2019-12-26 22:37:21,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:21,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830728362] [2019-12-26 22:37:21,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:21,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:21,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411311729] [2019-12-26 22:37:21,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:21,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:21,697 INFO L87 Difference]: Start difference. First operand 36271 states and 108406 transitions. Second operand 3 states. [2019-12-26 22:37:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:21,815 INFO L93 Difference]: Finished difference Result 27379 states and 81332 transitions. [2019-12-26 22:37:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:21,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:37:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:21,862 INFO L225 Difference]: With dead ends: 27379 [2019-12-26 22:37:21,862 INFO L226 Difference]: Without dead ends: 27379 [2019-12-26 22:37:21,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27379 states. [2019-12-26 22:37:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27379 to 26035. [2019-12-26 22:37:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26035 states. [2019-12-26 22:37:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26035 states to 26035 states and 77222 transitions. [2019-12-26 22:37:22,256 INFO L78 Accepts]: Start accepts. Automaton has 26035 states and 77222 transitions. Word has length 65 [2019-12-26 22:37:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 26035 states and 77222 transitions. [2019-12-26 22:37:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26035 states and 77222 transitions. [2019-12-26 22:37:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:37:22,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:22,282 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-26 22:37:22,282 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-26 22:37:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-26 22:37:22,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:22,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911093599] [2019-12-26 22:37:22,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:22,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911093599] [2019-12-26 22:37:22,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:22,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:22,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850091023] [2019-12-26 22:37:22,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:22,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:22,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:22,337 INFO L87 Difference]: Start difference. First operand 26035 states and 77222 transitions. Second operand 3 states. [2019-12-26 22:37:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:22,430 INFO L93 Difference]: Finished difference Result 26035 states and 77221 transitions. [2019-12-26 22:37:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:37:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:22,466 INFO L225 Difference]: With dead ends: 26035 [2019-12-26 22:37:22,466 INFO L226 Difference]: Without dead ends: 26035 [2019-12-26 22:37:22,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26035 states. [2019-12-26 22:37:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26035 to 18509. [2019-12-26 22:37:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18509 states. [2019-12-26 22:37:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 55754 transitions. [2019-12-26 22:37:22,793 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 55754 transitions. Word has length 66 [2019-12-26 22:37:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:22,793 INFO L462 AbstractCegarLoop]: Abstraction has 18509 states and 55754 transitions. [2019-12-26 22:37:22,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 55754 transitions. [2019-12-26 22:37:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:37:22,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:22,813 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-26 22:37:22,813 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-26 22:37:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-26 22:37:22,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:22,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470969789] [2019-12-26 22:37:22,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:22,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:37:22,925 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:37:22,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_55|) |v_ULTIMATE.start_main_~#t1111~0.offset_34| 0))) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_34|) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1111~0.base_55|) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55|)) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_55| 1) |v_#valid_91|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_41|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_55|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_20|, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_19|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_28|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_34|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~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, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_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, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~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-26 22:37:22,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff0_thd0~0_In-371020964 ~a$r_buff1_thd0~0_Out-371020964) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-371020964 0)) (= ~a$r_buff1_thd2~0_Out-371020964 ~a$r_buff0_thd2~0_In-371020964) (= ~a$r_buff0_thd1~0_In-371020964 ~a$r_buff1_thd1~0_Out-371020964) (= ~a$r_buff1_thd3~0_Out-371020964 ~a$r_buff0_thd3~0_In-371020964) (= ~x~0_In-371020964 ~__unbuffered_p0_EAX~0_Out-371020964) (= 1 ~a$r_buff0_thd1~0_Out-371020964)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-371020964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-371020964, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-371020964, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-371020964, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-371020964, ~x~0=~x~0_In-371020964} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-371020964, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-371020964, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-371020964, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-371020964, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-371020964, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-371020964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-371020964, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-371020964, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-371020964, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-371020964, ~x~0=~x~0_In-371020964} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~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] because there is no mapped edge [2019-12-26 22:37:22,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:37:22,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-26 22:37:22,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1013880800 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1013880800| |P1Thread1of1ForFork2_#t~ite9_Out-1013880800|)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1013880800 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-1013880800 |P1Thread1of1ForFork2_#t~ite9_Out-1013880800|) .cse2) (and (= ~a$w_buff1~0_In-1013880800 |P1Thread1of1ForFork2_#t~ite9_Out-1013880800|) (not .cse1) .cse2 (not .cse0)))) InVars {~a~0=~a~0_In-1013880800, ~a$w_buff1~0=~a$w_buff1~0_In-1013880800, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1013880800, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013880800} OutVars{~a~0=~a~0_In-1013880800, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1013880800|, ~a$w_buff1~0=~a$w_buff1~0_In-1013880800, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1013880800, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1013880800|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1013880800} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:37:22,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1366824203 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1366824203 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1366824203|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1366824203 |P1Thread1of1ForFork2_#t~ite11_Out-1366824203|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1366824203, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1366824203} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1366824203, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1366824203, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1366824203|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:37:22,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1376675690 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1376675690 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1376675690 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1376675690 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1376675690| ~a$w_buff1_used~0_In-1376675690) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1376675690| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1376675690, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1376675690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376675690, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376675690} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1376675690, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1376675690, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1376675690, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1376675690|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1376675690} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:37:22,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In830038687 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In830038687 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In830038687 256)) (and (= (mod ~a$r_buff1_thd3~0_In830038687 256) 0) .cse0) (and (= (mod ~a$w_buff1_used~0_In830038687 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite20_Out830038687| ~a$w_buff0~0_In830038687) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out830038687| |P2Thread1of1ForFork0_#t~ite20_Out830038687|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In830038687| |P2Thread1of1ForFork0_#t~ite20_Out830038687|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite21_Out830038687| ~a$w_buff0~0_In830038687)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In830038687, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In830038687, ~a$w_buff0_used~0=~a$w_buff0_used~0_In830038687, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In830038687, ~a$w_buff1_used~0=~a$w_buff1_used~0_In830038687, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In830038687|, ~weak$$choice2~0=~weak$$choice2~0_In830038687} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out830038687|, ~a$w_buff0~0=~a$w_buff0~0_In830038687, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In830038687, ~a$w_buff0_used~0=~a$w_buff0_used~0_In830038687, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In830038687, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out830038687|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In830038687, ~weak$$choice2~0=~weak$$choice2~0_In830038687} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 22:37:22,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-752363902 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-752363902 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-752363902| ~a$r_buff0_thd2~0_In-752363902) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-752363902| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-752363902, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-752363902} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-752363902, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-752363902, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-752363902|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:37:22,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1679555998 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1679555998 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1679555998 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1679555998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1679555998| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-1679555998| ~a$r_buff1_thd2~0_In-1679555998)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1679555998, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1679555998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679555998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679555998} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1679555998, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1679555998, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679555998, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679555998, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1679555998|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:37:22,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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-26 22:37:22,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1918963101 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1918963101 256)))) (or (= (mod ~a$w_buff0_used~0_In1918963101 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1918963101 256)) .cse0) (and (= (mod ~a$r_buff1_thd3~0_In1918963101 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite23_Out1918963101| |P2Thread1of1ForFork0_#t~ite24_Out1918963101|) (= |P2Thread1of1ForFork0_#t~ite23_Out1918963101| ~a$w_buff1~0_In1918963101) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1918963101| |P2Thread1of1ForFork0_#t~ite23_Out1918963101|) (= ~a$w_buff1~0_In1918963101 |P2Thread1of1ForFork0_#t~ite24_Out1918963101|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1918963101, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1918963101|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1918963101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1918963101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1918963101, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1918963101, ~weak$$choice2~0=~weak$$choice2~0_In1918963101} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1918963101, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1918963101|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1918963101|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1918963101, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1918963101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1918963101, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1918963101, ~weak$$choice2~0=~weak$$choice2~0_In1918963101} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:37:22,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-197256964 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-197256964| |P2Thread1of1ForFork0_#t~ite27_Out-197256964|) (= |P2Thread1of1ForFork0_#t~ite26_Out-197256964| ~a$w_buff0_used~0_In-197256964) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-197256964 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-197256964 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-197256964 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-197256964 256))))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-197256964| |P2Thread1of1ForFork0_#t~ite26_Out-197256964|) (= |P2Thread1of1ForFork0_#t~ite27_Out-197256964| ~a$w_buff0_used~0_In-197256964) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-197256964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-197256964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-197256964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-197256964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-197256964, ~weak$$choice2~0=~weak$$choice2~0_In-197256964} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-197256964|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-197256964|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-197256964, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-197256964, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-197256964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-197256964, ~weak$$choice2~0=~weak$$choice2~0_In-197256964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:37:22,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:37:22,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 22:37:22,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1925349412 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1925349412 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1925349412 |P2Thread1of1ForFork0_#t~ite38_Out1925349412|)) (and (= ~a~0_In1925349412 |P2Thread1of1ForFork0_#t~ite38_Out1925349412|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1925349412, ~a$w_buff1~0=~a$w_buff1~0_In1925349412, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1925349412, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1925349412} OutVars{~a~0=~a~0_In1925349412, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1925349412|, ~a$w_buff1~0=~a$w_buff1~0_In1925349412, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1925349412, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1925349412} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:37:22,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:37:22,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1916604737 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1916604737 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1916604737| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1916604737| ~a$w_buff0_used~0_In-1916604737) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1916604737, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1916604737} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1916604737|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1916604737, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1916604737} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:37:22,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In918415506 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In918415506 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out918415506|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out918415506| ~a$w_buff0_used~0_In918415506) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In918415506, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In918415506} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out918415506|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In918415506, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In918415506} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:37:22,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-688157047 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-688157047 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-688157047 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-688157047 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-688157047 |P0Thread1of1ForFork1_#t~ite6_Out-688157047|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-688157047|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-688157047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-688157047, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-688157047, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-688157047} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-688157047|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-688157047, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-688157047, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-688157047, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-688157047} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:37:22,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In953900473 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In953900473 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out953900473 ~a$r_buff0_thd1~0_In953900473) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out953900473 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In953900473, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In953900473} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out953900473|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In953900473, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out953900473} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:37:22,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-783474273 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-783474273 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-783474273 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-783474273 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-783474273|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd1~0_In-783474273 |P0Thread1of1ForFork1_#t~ite8_Out-783474273|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-783474273, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-783474273, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-783474273, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-783474273} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-783474273|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-783474273, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-783474273, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-783474273, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-783474273} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:37:22,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} 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-26 22:37:22,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd3~0_In1168462088 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1168462088 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1168462088 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1168462088 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1168462088| ~a$w_buff1_used~0_In1168462088)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite41_Out1168462088| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1168462088, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1168462088, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1168462088, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1168462088} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1168462088, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1168462088, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1168462088, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1168462088, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1168462088|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:37:22,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-306469403 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-306469403 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-306469403|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd3~0_In-306469403 |P2Thread1of1ForFork0_#t~ite42_Out-306469403|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-306469403, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-306469403} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-306469403, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-306469403, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-306469403|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:37:22,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1402677670 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1402677670 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1402677670 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1402677670 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1402677670|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In1402677670 |P2Thread1of1ForFork0_#t~ite43_Out1402677670|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1402677670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1402677670, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1402677670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1402677670} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1402677670|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1402677670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1402677670, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1402677670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1402677670} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:37:22,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, 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-26 22:37:22,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:37:22,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In1759495903 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1759495903 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1759495903| |ULTIMATE.start_main_#t~ite48_Out1759495903|))) (or (and (or .cse0 .cse1) (= ~a~0_In1759495903 |ULTIMATE.start_main_#t~ite47_Out1759495903|) .cse2) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In1759495903 |ULTIMATE.start_main_#t~ite47_Out1759495903|) .cse2))) InVars {~a~0=~a~0_In1759495903, ~a$w_buff1~0=~a$w_buff1~0_In1759495903, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1759495903, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759495903} OutVars{~a~0=~a~0_In1759495903, ~a$w_buff1~0=~a$w_buff1~0_In1759495903, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1759495903|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1759495903, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1759495903|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1759495903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:37:22,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-478660939 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-478660939 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-478660939| ~a$w_buff0_used~0_In-478660939)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-478660939| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-478660939, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-478660939} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-478660939, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-478660939|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-478660939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:37:22,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-2132304923 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2132304923 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-2132304923 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2132304923 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-2132304923|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-2132304923 |ULTIMATE.start_main_#t~ite50_Out-2132304923|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2132304923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2132304923, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2132304923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2132304923} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2132304923|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2132304923, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2132304923, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2132304923, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2132304923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:37:22,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1569763019 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1569763019 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In1569763019 |ULTIMATE.start_main_#t~ite51_Out1569763019|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1569763019|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569763019, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569763019} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1569763019|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569763019, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569763019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:37:22,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1269261863 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1269261863 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1269261863 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1269261863 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1269261863|)) (and (= ~a$r_buff1_thd0~0_In-1269261863 |ULTIMATE.start_main_#t~ite52_Out-1269261863|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1269261863, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1269261863, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1269261863, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1269261863} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1269261863|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1269261863, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1269261863, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1269261863, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1269261863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:37:22,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-26 22:37:23,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:37:23 BasicIcfg [2019-12-26 22:37:23,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:37:23,045 INFO L168 Benchmark]: Toolchain (without parser) took 120976.41 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.0 MB in the beginning and 1.1 GB in the end (delta: -955.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,045 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 902.46 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 154.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,047 INFO L168 Benchmark]: Boogie Preprocessor took 40.69 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,047 INFO L168 Benchmark]: RCFGBuilder took 848.11 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 99.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,048 INFO L168 Benchmark]: TraceAbstraction took 119091.66 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -956.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:23,050 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 902.46 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 154.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.69 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.11 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 99.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119091.66 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.7 MB in the beginning and 1.1 GB in the end (delta: -956.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, z=0] [L768] EXPR 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=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=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 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=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=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 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) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 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)) [L770] 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 [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 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)) [L798] 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)) [L799] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=8, 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=2, z=1] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=8, 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=2, z=1] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 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) [L807] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=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=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 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 [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 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 [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 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=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=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=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.7s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10063 SDtfs, 15104 SDslu, 28676 SDs, 0 SdLazy, 19791 SolverSat, 914 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 142 SyntacticMatches, 30 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 44.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 747950 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1911 NumberOfCodeBlocks, 1911 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 351307 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...