/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/mix010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:23:41,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:23:41,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:23:41,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:23:41,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:23:41,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:23:41,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:23:41,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:23:41,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:23:41,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:23:41,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:23:41,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:23:41,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:23:41,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:23:41,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:23:41,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:23:41,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:23:41,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:23:41,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:23:41,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:23:41,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:23:41,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:23:41,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:23:41,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:23:41,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:23:41,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:23:41,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:23:41,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:23:41,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:23:41,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:23:41,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:23:41,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:23:41,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:23:41,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:23:41,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:23:41,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:23:41,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:23:41,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:23:41,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:23:41,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:23:41,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:23:41,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:23:41,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:23:41,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:23:41,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:23:41,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:23:41,888 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:23:41,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:23:41,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:23:41,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:23:41,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:23:41,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:23:41,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:23:41,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:23:41,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:23:41,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:23:41,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:23:41,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:23:41,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:41,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:23:41,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:23:41,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:23:41,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:23:41,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:23:41,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:23:41,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:23:41,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:23:42,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:23:42,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:23:42,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:23:42,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:23:42,228 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:23:42,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-18 12:23:42,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7e18a99/8bb2ab2de1a94dd79eed6c38f520530f/FLAG47c8f99a5 [2019-12-18 12:23:42,903 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:23:42,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-18 12:23:42,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7e18a99/8bb2ab2de1a94dd79eed6c38f520530f/FLAG47c8f99a5 [2019-12-18 12:23:43,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7e18a99/8bb2ab2de1a94dd79eed6c38f520530f [2019-12-18 12:23:43,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:23:43,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:23:43,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:43,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:23:43,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:23:43,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:43" (1/1) ... [2019-12-18 12:23:43,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b75db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:43, skipping insertion in model container [2019-12-18 12:23:43,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:23:43" (1/1) ... [2019-12-18 12:23:43,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:23:43,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:23:43,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:43,829 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:23:43,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:23:44,027 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:23:44,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44 WrapperNode [2019-12-18 12:23:44,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:23:44,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:44,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:23:44,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:23:44,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:23:44,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:23:44,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:23:44,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:23:44,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... [2019-12-18 12:23:44,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:23:44,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:23:44,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:23:44,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:23:44,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:23:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:23:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:23:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:23:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:23:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:23:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:23:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:23:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:23:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:23:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:23:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:23:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:23:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:23:44,237 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:23:45,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:23:45,038 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:23:45,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:45 BoogieIcfgContainer [2019-12-18 12:23:45,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:23:45,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:23:45,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:23:45,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:23:45,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:23:43" (1/3) ... [2019-12-18 12:23:45,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:45, skipping insertion in model container [2019-12-18 12:23:45,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:23:44" (2/3) ... [2019-12-18 12:23:45,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2519f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:23:45, skipping insertion in model container [2019-12-18 12:23:45,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:23:45" (3/3) ... [2019-12-18 12:23:45,048 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.oepc.i [2019-12-18 12:23:45,059 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:23:45,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:23:45,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:23:45,069 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:23:45,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,116 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,116 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,150 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,150 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,183 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:23:45,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:23:45,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:23:45,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:23:45,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:23:45,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:23:45,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:23:45,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:23:45,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:23:45,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:23:45,258 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:23:45,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:45,351 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:45,351 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:45,371 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:45,400 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:23:45,452 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:23:45,452 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:23:45,462 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:23:45,487 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:23:45,488 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:23:50,837 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:23:50,974 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:23:51,007 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-18 12:23:51,007 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:23:51,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 12:24:14,528 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 12:24:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 12:24:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:24:14,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:14,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:24:14,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-18 12:24:14,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:14,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276522354] [2019-12-18 12:24:14,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:14,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276522354] [2019-12-18 12:24:14,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:14,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:24:14,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322102750] [2019-12-18 12:24:14,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:14,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:14,821 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 12:24:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:15,996 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-18 12:24:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:15,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:24:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:19,885 INFO L225 Difference]: With dead ends: 125226 [2019-12-18 12:24:19,885 INFO L226 Difference]: Without dead ends: 117946 [2019-12-18 12:24:19,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-18 12:24:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-18 12:24:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-18 12:24:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-18 12:24:33,585 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-18 12:24:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:33,585 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-18 12:24:33,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-18 12:24:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:24:33,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:33,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:33,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-18 12:24:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:33,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637790964] [2019-12-18 12:24:33,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:33,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637790964] [2019-12-18 12:24:33,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:33,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:33,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642965532] [2019-12-18 12:24:33,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:24:33,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:24:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:24:33,710 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-18 12:24:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:34,957 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-18 12:24:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:24:34,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:24:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:35,686 INFO L225 Difference]: With dead ends: 183040 [2019-12-18 12:24:35,686 INFO L226 Difference]: Without dead ends: 182991 [2019-12-18 12:24:35,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-18 12:24:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-18 12:24:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-18 12:24:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-18 12:24:51,126 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-18 12:24:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:51,126 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-18 12:24:51,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:24:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-18 12:24:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:24:51,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:51,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:51,133 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-18 12:24:51,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:51,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337254263] [2019-12-18 12:24:51,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:51,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337254263] [2019-12-18 12:24:51,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:24:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76281347] [2019-12-18 12:24:51,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:24:51,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:24:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:51,201 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-18 12:24:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:56,406 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-18 12:24:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:24:56,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:24:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:56,472 INFO L225 Difference]: With dead ends: 35531 [2019-12-18 12:24:56,473 INFO L226 Difference]: Without dead ends: 35531 [2019-12-18 12:24:56,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:24:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-18 12:24:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-18 12:24:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 12:24:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-18 12:24:57,189 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-18 12:24:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:57,190 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-18 12:24:57,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:24:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-18 12:24:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:24:57,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:57,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:57,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-18 12:24:57,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:57,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340997294] [2019-12-18 12:24:57,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:57,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340997294] [2019-12-18 12:24:57,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:57,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:24:57,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595758517] [2019-12-18 12:24:57,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:24:57,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:24:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:24:57,297 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-18 12:24:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:24:57,898 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-18 12:24:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:24:57,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:24:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:24:57,982 INFO L225 Difference]: With dead ends: 49606 [2019-12-18 12:24:57,982 INFO L226 Difference]: Without dead ends: 49606 [2019-12-18 12:24:57,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-18 12:24:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-18 12:24:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-18 12:24:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-18 12:24:59,106 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-18 12:24:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:24:59,108 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-18 12:24:59,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:24:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-18 12:24:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:24:59,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:24:59,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:24:59,121 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:24:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:24:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-18 12:24:59,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:24:59,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970174703] [2019-12-18 12:24:59,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:24:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:24:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:24:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970174703] [2019-12-18 12:24:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:24:59,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:24:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703863324] [2019-12-18 12:24:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:24:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:24:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:24:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:24:59,285 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-18 12:25:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:00,305 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-18 12:25:00,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:00,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 12:25:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:00,418 INFO L225 Difference]: With dead ends: 68217 [2019-12-18 12:25:00,419 INFO L226 Difference]: Without dead ends: 68203 [2019-12-18 12:25:00,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-18 12:25:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-18 12:25:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-18 12:25:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-18 12:25:01,830 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-18 12:25:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:01,831 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-18 12:25:01,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-18 12:25:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:25:01,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:01,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:01,847 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-18 12:25:01,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:01,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750840850] [2019-12-18 12:25:01,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:01,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750840850] [2019-12-18 12:25:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:01,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749141606] [2019-12-18 12:25:01,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:01,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:01,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:01,898 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-18 12:25:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:01,968 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-18 12:25:01,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:01,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:25:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:02,000 INFO L225 Difference]: With dead ends: 16636 [2019-12-18 12:25:02,000 INFO L226 Difference]: Without dead ends: 16636 [2019-12-18 12:25:02,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-18 12:25:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-18 12:25:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-18 12:25:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-18 12:25:02,305 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-18 12:25:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:02,306 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-18 12:25:02,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-18 12:25:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:25:02,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:02,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:02,319 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-18 12:25:02,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:02,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439457820] [2019-12-18 12:25:02,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:02,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439457820] [2019-12-18 12:25:02,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:02,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:25:02,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56529152] [2019-12-18 12:25:02,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:25:02,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:25:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:25:02,431 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-18 12:25:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:02,954 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-18 12:25:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:25:02,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:25:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:02,987 INFO L225 Difference]: With dead ends: 23754 [2019-12-18 12:25:02,987 INFO L226 Difference]: Without dead ends: 23754 [2019-12-18 12:25:02,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-18 12:25:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-18 12:25:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-18 12:25:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-18 12:25:03,310 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-18 12:25:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:03,311 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-18 12:25:03,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:25:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-18 12:25:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:25:03,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:03,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:03,331 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-18 12:25:03,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:03,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371604049] [2019-12-18 12:25:03,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:03,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371604049] [2019-12-18 12:25:03,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:03,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:03,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906047822] [2019-12-18 12:25:03,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:03,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:03,421 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-18 12:25:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:03,806 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-18 12:25:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:25:03,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:25:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:03,849 INFO L225 Difference]: With dead ends: 23902 [2019-12-18 12:25:03,849 INFO L226 Difference]: Without dead ends: 23902 [2019-12-18 12:25:03,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-18 12:25:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-18 12:25:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-18 12:25:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-18 12:25:04,184 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-18 12:25:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:04,184 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-18 12:25:04,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-18 12:25:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:25:04,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:04,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:04,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-18 12:25:04,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:04,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019016848] [2019-12-18 12:25:04,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019016848] [2019-12-18 12:25:04,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:04,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:25:04,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759989517] [2019-12-18 12:25:04,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:04,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:04,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:04,302 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-18 12:25:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:05,756 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-18 12:25:05,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:25:05,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:25:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:05,797 INFO L225 Difference]: With dead ends: 27626 [2019-12-18 12:25:05,797 INFO L226 Difference]: Without dead ends: 27626 [2019-12-18 12:25:05,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-18 12:25:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-18 12:25:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-18 12:25:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-18 12:25:06,137 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-18 12:25:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:06,137 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-18 12:25:06,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-18 12:25:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:25:06,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:06,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:06,160 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-18 12:25:06,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:06,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264893799] [2019-12-18 12:25:06,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:06,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264893799] [2019-12-18 12:25:06,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:06,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:25:06,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181091772] [2019-12-18 12:25:06,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:06,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:06,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:06,242 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-18 12:25:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:06,309 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-18 12:25:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:06,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:25:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:06,340 INFO L225 Difference]: With dead ends: 17399 [2019-12-18 12:25:06,340 INFO L226 Difference]: Without dead ends: 17399 [2019-12-18 12:25:06,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-18 12:25:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-18 12:25:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-18 12:25:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-18 12:25:06,604 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-18 12:25:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:06,604 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-18 12:25:06,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-18 12:25:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:25:06,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:06,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:06,627 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:06,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-18 12:25:06,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:06,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19488349] [2019-12-18 12:25:06,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:06,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19488349] [2019-12-18 12:25:06,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:06,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:25:06,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208290337] [2019-12-18 12:25:06,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:25:06,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:25:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:25:06,724 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-18 12:25:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:07,662 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-18 12:25:07,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:25:07,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:25:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:07,713 INFO L225 Difference]: With dead ends: 34243 [2019-12-18 12:25:07,713 INFO L226 Difference]: Without dead ends: 34243 [2019-12-18 12:25:07,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-18 12:25:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-18 12:25:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-18 12:25:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-18 12:25:08,374 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-18 12:25:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-18 12:25:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:25:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-18 12:25:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:25:08,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:08,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:08,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-18 12:25:08,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:08,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034190027] [2019-12-18 12:25:08,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:08,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034190027] [2019-12-18 12:25:08,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:08,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:25:08,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341519080] [2019-12-18 12:25:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:08,502 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-18 12:25:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:09,089 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-18 12:25:09,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:25:09,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:25:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:09,136 INFO L225 Difference]: With dead ends: 30046 [2019-12-18 12:25:09,136 INFO L226 Difference]: Without dead ends: 30046 [2019-12-18 12:25:09,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:25:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-18 12:25:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-18 12:25:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 12:25:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-18 12:25:09,583 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-18 12:25:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:09,583 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-18 12:25:09,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-18 12:25:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:25:09,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:09,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:09,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-18 12:25:09,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:09,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808267193] [2019-12-18 12:25:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:09,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808267193] [2019-12-18 12:25:09,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:09,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:25:09,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806024059] [2019-12-18 12:25:09,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:09,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:09,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:09,685 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-18 12:25:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:09,810 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-18 12:25:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:25:09,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:25:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:09,862 INFO L225 Difference]: With dead ends: 25470 [2019-12-18 12:25:09,862 INFO L226 Difference]: Without dead ends: 25470 [2019-12-18 12:25:09,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-18 12:25:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-18 12:25:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 12:25:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-18 12:25:10,300 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-18 12:25:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:10,300 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-18 12:25:10,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-18 12:25:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:10,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:10,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:10,335 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:10,335 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-18 12:25:10,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:10,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618967667] [2019-12-18 12:25:10,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:10,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618967667] [2019-12-18 12:25:10,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:10,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:10,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825105688] [2019-12-18 12:25:10,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:10,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:10,399 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-18 12:25:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:10,550 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-18 12:25:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:10,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:25:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:10,598 INFO L225 Difference]: With dead ends: 34625 [2019-12-18 12:25:10,598 INFO L226 Difference]: Without dead ends: 34625 [2019-12-18 12:25:10,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-18 12:25:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-18 12:25:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-18 12:25:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-18 12:25:11,284 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-18 12:25:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:11,285 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-18 12:25:11,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-18 12:25:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:11,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:11,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:11,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-18 12:25:11,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:11,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348045422] [2019-12-18 12:25:11,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:11,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-18 12:25:11,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348045422] [2019-12-18 12:25:11,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:11,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:25:11,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240730751] [2019-12-18 12:25:11,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:11,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:11,409 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-18 12:25:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:12,099 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-18 12:25:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:25:12,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:25:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:12,198 INFO L225 Difference]: With dead ends: 73273 [2019-12-18 12:25:12,198 INFO L226 Difference]: Without dead ends: 55201 [2019-12-18 12:25:12,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:25:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-18 12:25:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-18 12:25:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-18 12:25:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-18 12:25:12,880 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-18 12:25:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:12,880 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-18 12:25:12,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-18 12:25:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:12,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:12,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:12,912 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-18 12:25:12,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:12,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945356315] [2019-12-18 12:25:12,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:12,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945356315] [2019-12-18 12:25:12,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:12,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:25:12,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953563705] [2019-12-18 12:25:12,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:12,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:12,999 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-18 12:25:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:13,563 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-18 12:25:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:25:13,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:25:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:13,643 INFO L225 Difference]: With dead ends: 81140 [2019-12-18 12:25:13,643 INFO L226 Difference]: Without dead ends: 57495 [2019-12-18 12:25:13,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:25:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-18 12:25:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-18 12:25:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-18 12:25:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-18 12:25:14,649 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-18 12:25:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:14,650 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-18 12:25:14,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-18 12:25:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:14,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:14,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:14,687 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-18 12:25:14,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:14,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654094526] [2019-12-18 12:25:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:14,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654094526] [2019-12-18 12:25:14,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:14,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:14,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103863432] [2019-12-18 12:25:14,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:14,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:14,778 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-18 12:25:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:15,902 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-18 12:25:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:25:15,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:25:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:16,031 INFO L225 Difference]: With dead ends: 98595 [2019-12-18 12:25:16,031 INFO L226 Difference]: Without dead ends: 87943 [2019-12-18 12:25:16,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-18 12:25:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-18 12:25:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-18 12:25:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-18 12:25:17,477 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-18 12:25:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:17,477 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-18 12:25:17,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-18 12:25:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:17,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:17,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:17,514 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-18 12:25:17,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:17,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379157046] [2019-12-18 12:25:17,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:17,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379157046] [2019-12-18 12:25:17,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:17,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:17,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406447928] [2019-12-18 12:25:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:17,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:17,623 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-18 12:25:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:19,097 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-18 12:25:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:25:19,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:25:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:19,256 INFO L225 Difference]: With dead ends: 119468 [2019-12-18 12:25:19,256 INFO L226 Difference]: Without dead ends: 105156 [2019-12-18 12:25:19,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:25:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-18 12:25:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-18 12:25:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-18 12:25:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-18 12:25:21,015 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-18 12:25:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:21,016 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-18 12:25:21,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-18 12:25:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:21,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:21,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:21,056 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-18 12:25:21,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:21,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375389714] [2019-12-18 12:25:21,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375389714] [2019-12-18 12:25:21,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:21,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:21,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462134433] [2019-12-18 12:25:21,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:21,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:21,175 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-18 12:25:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:22,756 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-18 12:25:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:25:22,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:25:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:22,956 INFO L225 Difference]: With dead ends: 131669 [2019-12-18 12:25:22,956 INFO L226 Difference]: Without dead ends: 121803 [2019-12-18 12:25:22,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:25:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-18 12:25:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-18 12:25:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-18 12:25:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-18 12:25:24,292 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-18 12:25:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:24,292 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-18 12:25:24,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-18 12:25:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:25:24,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:24,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:24,335 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-18 12:25:24,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:24,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146819368] [2019-12-18 12:25:24,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:24,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146819368] [2019-12-18 12:25:24,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:24,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:24,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30908877] [2019-12-18 12:25:24,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:24,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:24,390 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-18 12:25:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:24,858 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-18 12:25:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:24,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:25:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:24,914 INFO L225 Difference]: With dead ends: 42547 [2019-12-18 12:25:24,915 INFO L226 Difference]: Without dead ends: 42547 [2019-12-18 12:25:24,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-18 12:25:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-18 12:25:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-18 12:25:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-18 12:25:25,509 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-18 12:25:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:25,509 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-18 12:25:25,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-18 12:25:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:25,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:25,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:25,548 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-18 12:25:25,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:25,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131859932] [2019-12-18 12:25:25,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131859932] [2019-12-18 12:25:25,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:25,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:25,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096639805] [2019-12-18 12:25:25,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:25,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:25,647 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-18 12:25:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:26,882 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-18 12:25:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:25:26,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:25:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:27,037 INFO L225 Difference]: With dead ends: 111740 [2019-12-18 12:25:27,037 INFO L226 Difference]: Without dead ends: 99733 [2019-12-18 12:25:27,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-18 12:25:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-18 12:25:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-18 12:25:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-18 12:25:28,544 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-18 12:25:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:28,545 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-18 12:25:28,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-18 12:25:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:28,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:28,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:28,587 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-18 12:25:28,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:28,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814761035] [2019-12-18 12:25:28,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:28,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814761035] [2019-12-18 12:25:28,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:28,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:28,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505006977] [2019-12-18 12:25:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:28,711 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-18 12:25:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:30,465 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-18 12:25:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:25:30,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:30,655 INFO L225 Difference]: With dead ends: 134194 [2019-12-18 12:25:30,655 INFO L226 Difference]: Without dead ends: 122325 [2019-12-18 12:25:30,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:25:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-18 12:25:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-18 12:25:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 12:25:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-18 12:25:31,925 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-18 12:25:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:31,925 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-18 12:25:31,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-18 12:25:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:32,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:32,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:32,309 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-18 12:25:32,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:32,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079443359] [2019-12-18 12:25:32,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:32,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079443359] [2019-12-18 12:25:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:32,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:32,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551381665] [2019-12-18 12:25:32,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:32,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:32,414 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-18 12:25:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:34,253 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-18 12:25:34,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:25:34,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:34,465 INFO L225 Difference]: With dead ends: 153077 [2019-12-18 12:25:34,466 INFO L226 Difference]: Without dead ends: 125434 [2019-12-18 12:25:34,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:25:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-18 12:25:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-18 12:25:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-18 12:25:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-18 12:25:35,758 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-18 12:25:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:35,758 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-18 12:25:35,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-18 12:25:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:35,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:35,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:35,799 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-18 12:25:35,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:35,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358542848] [2019-12-18 12:25:35,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:35,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358542848] [2019-12-18 12:25:35,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:35,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:35,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901579220] [2019-12-18 12:25:35,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:35,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:35,897 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-18 12:25:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:37,181 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-18 12:25:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:37,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:37,272 INFO L225 Difference]: With dead ends: 55596 [2019-12-18 12:25:37,273 INFO L226 Difference]: Without dead ends: 55596 [2019-12-18 12:25:37,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-18 12:25:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-18 12:25:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-18 12:25:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-18 12:25:38,037 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-18 12:25:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:38,037 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-18 12:25:38,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-18 12:25:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:38,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:38,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:38,082 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-18 12:25:38,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:38,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246042720] [2019-12-18 12:25:38,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:38,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246042720] [2019-12-18 12:25:38,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:38,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:25:38,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230346708] [2019-12-18 12:25:38,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:38,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:38,192 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-18 12:25:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:40,148 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-18 12:25:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:25:40,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:25:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:40,243 INFO L225 Difference]: With dead ends: 66164 [2019-12-18 12:25:40,243 INFO L226 Difference]: Without dead ends: 66164 [2019-12-18 12:25:40,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:25:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-18 12:25:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-18 12:25:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-18 12:25:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-18 12:25:41,505 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-18 12:25:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:41,506 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-18 12:25:41,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-18 12:25:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:41,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:41,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:41,554 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-18 12:25:41,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:41,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958777725] [2019-12-18 12:25:41,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:41,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958777725] [2019-12-18 12:25:41,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:41,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:41,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011887304] [2019-12-18 12:25:41,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:41,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:41,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:41,679 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 8 states. [2019-12-18 12:25:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:43,396 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-18 12:25:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:25:43,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:25:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:43,479 INFO L225 Difference]: With dead ends: 55795 [2019-12-18 12:25:43,480 INFO L226 Difference]: Without dead ends: 55795 [2019-12-18 12:25:43,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:25:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-18 12:25:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-18 12:25:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-18 12:25:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-18 12:25:44,303 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-18 12:25:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:44,303 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-18 12:25:44,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-18 12:25:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:44,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:44,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:44,357 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-18 12:25:44,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:44,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856011953] [2019-12-18 12:25:44,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:44,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856011953] [2019-12-18 12:25:44,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:44,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:25:44,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819174669] [2019-12-18 12:25:44,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:44,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:44,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:44,459 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 7 states. [2019-12-18 12:25:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:45,634 INFO L93 Difference]: Finished difference Result 63283 states and 194671 transitions. [2019-12-18 12:25:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:25:45,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:25:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:45,726 INFO L225 Difference]: With dead ends: 63283 [2019-12-18 12:25:45,727 INFO L226 Difference]: Without dead ends: 63283 [2019-12-18 12:25:45,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:25:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63283 states. [2019-12-18 12:25:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63283 to 42978. [2019-12-18 12:25:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42978 states. [2019-12-18 12:25:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42978 states to 42978 states and 133075 transitions. [2019-12-18 12:25:46,955 INFO L78 Accepts]: Start accepts. Automaton has 42978 states and 133075 transitions. Word has length 65 [2019-12-18 12:25:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:46,956 INFO L462 AbstractCegarLoop]: Abstraction has 42978 states and 133075 transitions. [2019-12-18 12:25:46,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42978 states and 133075 transitions. [2019-12-18 12:25:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:47,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:47,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:47,009 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-18 12:25:47,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:47,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812318123] [2019-12-18 12:25:47,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:47,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-18 12:25:47,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812318123] [2019-12-18 12:25:47,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:47,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:25:47,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561660561] [2019-12-18 12:25:47,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:47,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:47,148 INFO L87 Difference]: Start difference. First operand 42978 states and 133075 transitions. Second operand 10 states. [2019-12-18 12:25:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:49,931 INFO L93 Difference]: Finished difference Result 66926 states and 204148 transitions. [2019-12-18 12:25:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:25:49,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:25:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:50,027 INFO L225 Difference]: With dead ends: 66926 [2019-12-18 12:25:50,027 INFO L226 Difference]: Without dead ends: 66926 [2019-12-18 12:25:50,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:25:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66926 states. [2019-12-18 12:25:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66926 to 39586. [2019-12-18 12:25:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 12:25:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 123177 transitions. [2019-12-18 12:25:50,844 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 123177 transitions. Word has length 65 [2019-12-18 12:25:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:50,844 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 123177 transitions. [2019-12-18 12:25:50,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:25:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 123177 transitions. [2019-12-18 12:25:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:50,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:50,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:50,887 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1534293356, now seen corresponding path program 6 times [2019-12-18 12:25:50,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:50,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934949443] [2019-12-18 12:25:50,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:50,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934949443] [2019-12-18 12:25:50,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:50,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469743368] [2019-12-18 12:25:50,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:50,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:50,955 INFO L87 Difference]: Start difference. First operand 39586 states and 123177 transitions. Second operand 4 states. [2019-12-18 12:25:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:51,244 INFO L93 Difference]: Finished difference Result 39586 states and 122905 transitions. [2019-12-18 12:25:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:51,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:25:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:51,326 INFO L225 Difference]: With dead ends: 39586 [2019-12-18 12:25:51,326 INFO L226 Difference]: Without dead ends: 39586 [2019-12-18 12:25:51,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39586 states. [2019-12-18 12:25:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39586 to 37695. [2019-12-18 12:25:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2019-12-18 12:25:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 117130 transitions. [2019-12-18 12:25:52,231 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 117130 transitions. Word has length 65 [2019-12-18 12:25:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:52,231 INFO L462 AbstractCegarLoop]: Abstraction has 37695 states and 117130 transitions. [2019-12-18 12:25:52,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 117130 transitions. [2019-12-18 12:25:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:25:52,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:52,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:52,275 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-18 12:25:52,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:52,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078235486] [2019-12-18 12:25:52,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:52,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078235486] [2019-12-18 12:25:52,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:52,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:52,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519760557] [2019-12-18 12:25:52,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:52,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:52,354 INFO L87 Difference]: Start difference. First operand 37695 states and 117130 transitions. Second operand 3 states. [2019-12-18 12:25:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:52,515 INFO L93 Difference]: Finished difference Result 30460 states and 93467 transitions. [2019-12-18 12:25:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:52,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:25:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:52,583 INFO L225 Difference]: With dead ends: 30460 [2019-12-18 12:25:52,584 INFO L226 Difference]: Without dead ends: 30460 [2019-12-18 12:25:52,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30460 states. [2019-12-18 12:25:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30460 to 29088. [2019-12-18 12:25:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29088 states. [2019-12-18 12:25:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 88849 transitions. [2019-12-18 12:25:53,192 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 88849 transitions. Word has length 65 [2019-12-18 12:25:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:53,193 INFO L462 AbstractCegarLoop]: Abstraction has 29088 states and 88849 transitions. [2019-12-18 12:25:53,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 88849 transitions. [2019-12-18 12:25:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:53,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:53,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:53,223 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -576070305, now seen corresponding path program 1 times [2019-12-18 12:25:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:53,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597340355] [2019-12-18 12:25:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:53,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597340355] [2019-12-18 12:25:53,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:53,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:53,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659130244] [2019-12-18 12:25:53,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:25:53,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:25:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:25:53,326 INFO L87 Difference]: Start difference. First operand 29088 states and 88849 transitions. Second operand 9 states. [2019-12-18 12:25:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:54,806 INFO L93 Difference]: Finished difference Result 57662 states and 174656 transitions. [2019-12-18 12:25:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:25:54,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:25:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:54,868 INFO L225 Difference]: With dead ends: 57662 [2019-12-18 12:25:54,868 INFO L226 Difference]: Without dead ends: 46529 [2019-12-18 12:25:54,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:25:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46529 states. [2019-12-18 12:25:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46529 to 29913. [2019-12-18 12:25:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29913 states. [2019-12-18 12:25:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29913 states to 29913 states and 90873 transitions. [2019-12-18 12:25:55,514 INFO L78 Accepts]: Start accepts. Automaton has 29913 states and 90873 transitions. Word has length 66 [2019-12-18 12:25:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:55,515 INFO L462 AbstractCegarLoop]: Abstraction has 29913 states and 90873 transitions. [2019-12-18 12:25:55,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:25:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29913 states and 90873 transitions. [2019-12-18 12:25:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:55,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:55,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:55,548 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -454529783, now seen corresponding path program 2 times [2019-12-18 12:25:55,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:55,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568707628] [2019-12-18 12:25:55,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:55,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568707628] [2019-12-18 12:25:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426158577] [2019-12-18 12:25:55,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:55,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:55,678 INFO L87 Difference]: Start difference. First operand 29913 states and 90873 transitions. Second operand 8 states. [2019-12-18 12:25:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:57,697 INFO L93 Difference]: Finished difference Result 47650 states and 141315 transitions. [2019-12-18 12:25:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:57,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:25:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:57,763 INFO L225 Difference]: With dead ends: 47650 [2019-12-18 12:25:57,764 INFO L226 Difference]: Without dead ends: 47242 [2019-12-18 12:25:57,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47242 states. [2019-12-18 12:25:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47242 to 33223. [2019-12-18 12:25:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33223 states. [2019-12-18 12:25:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33223 states to 33223 states and 100464 transitions. [2019-12-18 12:25:58,364 INFO L78 Accepts]: Start accepts. Automaton has 33223 states and 100464 transitions. Word has length 66 [2019-12-18 12:25:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:58,364 INFO L462 AbstractCegarLoop]: Abstraction has 33223 states and 100464 transitions. [2019-12-18 12:25:58,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:25:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33223 states and 100464 transitions. [2019-12-18 12:25:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:25:58,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:58,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:58,401 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1507528227, now seen corresponding path program 3 times [2019-12-18 12:25:58,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:58,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264014757] [2019-12-18 12:25:58,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:58,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264014757] [2019-12-18 12:25:58,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:58,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:25:58,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958834491] [2019-12-18 12:25:58,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:25:58,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:25:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:58,537 INFO L87 Difference]: Start difference. First operand 33223 states and 100464 transitions. Second operand 10 states. [2019-12-18 12:25:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:59,555 INFO L93 Difference]: Finished difference Result 69452 states and 208525 transitions. [2019-12-18 12:25:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:25:59,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:25:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:59,647 INFO L225 Difference]: With dead ends: 69452 [2019-12-18 12:25:59,647 INFO L226 Difference]: Without dead ends: 65223 [2019-12-18 12:25:59,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:25:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65223 states. [2019-12-18 12:26:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65223 to 37478. [2019-12-18 12:26:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37478 states. [2019-12-18 12:26:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37478 states to 37478 states and 112982 transitions. [2019-12-18 12:26:00,442 INFO L78 Accepts]: Start accepts. Automaton has 37478 states and 112982 transitions. Word has length 66 [2019-12-18 12:26:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 37478 states and 112982 transitions. [2019-12-18 12:26:00,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37478 states and 112982 transitions. [2019-12-18 12:26:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:00,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:00,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:00,485 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash -318994055, now seen corresponding path program 4 times [2019-12-18 12:26:00,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:00,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932305718] [2019-12-18 12:26:00,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:00,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932305718] [2019-12-18 12:26:00,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:00,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:00,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632791598] [2019-12-18 12:26:00,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:26:00,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:26:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:00,615 INFO L87 Difference]: Start difference. First operand 37478 states and 112982 transitions. Second operand 10 states. [2019-12-18 12:26:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:01,528 INFO L93 Difference]: Finished difference Result 64928 states and 194457 transitions. [2019-12-18 12:26:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:26:01,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:26:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:01,605 INFO L225 Difference]: With dead ends: 64928 [2019-12-18 12:26:01,606 INFO L226 Difference]: Without dead ends: 55982 [2019-12-18 12:26:01,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:26:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55982 states. [2019-12-18 12:26:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55982 to 32461. [2019-12-18 12:26:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32461 states. [2019-12-18 12:26:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32461 states to 32461 states and 97941 transitions. [2019-12-18 12:26:02,568 INFO L78 Accepts]: Start accepts. Automaton has 32461 states and 97941 transitions. Word has length 66 [2019-12-18 12:26:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:02,569 INFO L462 AbstractCegarLoop]: Abstraction has 32461 states and 97941 transitions. [2019-12-18 12:26:02,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32461 states and 97941 transitions. [2019-12-18 12:26:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:02,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:02,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:02,606 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2072315671, now seen corresponding path program 5 times [2019-12-18 12:26:02,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:02,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689393129] [2019-12-18 12:26:02,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:02,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689393129] [2019-12-18 12:26:02,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:02,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:02,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352922709] [2019-12-18 12:26:02,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:02,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:02,762 INFO L87 Difference]: Start difference. First operand 32461 states and 97941 transitions. Second operand 11 states. [2019-12-18 12:26:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:03,818 INFO L93 Difference]: Finished difference Result 60488 states and 181662 transitions. [2019-12-18 12:26:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:26:03,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:26:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:03,906 INFO L225 Difference]: With dead ends: 60488 [2019-12-18 12:26:03,906 INFO L226 Difference]: Without dead ends: 58451 [2019-12-18 12:26:03,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:26:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58451 states. [2019-12-18 12:26:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58451 to 35440. [2019-12-18 12:26:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35440 states. [2019-12-18 12:26:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35440 states to 35440 states and 106788 transitions. [2019-12-18 12:26:04,650 INFO L78 Accepts]: Start accepts. Automaton has 35440 states and 106788 transitions. Word has length 66 [2019-12-18 12:26:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:04,650 INFO L462 AbstractCegarLoop]: Abstraction has 35440 states and 106788 transitions. [2019-12-18 12:26:04,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35440 states and 106788 transitions. [2019-12-18 12:26:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:04,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:04,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:04,687 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 396129343, now seen corresponding path program 6 times [2019-12-18 12:26:04,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229108577] [2019-12-18 12:26:04,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:04,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229108577] [2019-12-18 12:26:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:04,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704163113] [2019-12-18 12:26:04,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:04,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:04,829 INFO L87 Difference]: Start difference. First operand 35440 states and 106788 transitions. Second operand 11 states. [2019-12-18 12:26:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:05,921 INFO L93 Difference]: Finished difference Result 58829 states and 176105 transitions. [2019-12-18 12:26:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:26:05,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:26:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:05,998 INFO L225 Difference]: With dead ends: 58829 [2019-12-18 12:26:05,998 INFO L226 Difference]: Without dead ends: 54458 [2019-12-18 12:26:05,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:26:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54458 states. [2019-12-18 12:26:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54458 to 31595. [2019-12-18 12:26:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31595 states. [2019-12-18 12:26:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31595 states to 31595 states and 95341 transitions. [2019-12-18 12:26:07,067 INFO L78 Accepts]: Start accepts. Automaton has 31595 states and 95341 transitions. Word has length 66 [2019-12-18 12:26:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:07,067 INFO L462 AbstractCegarLoop]: Abstraction has 31595 states and 95341 transitions. [2019-12-18 12:26:07,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 31595 states and 95341 transitions. [2019-12-18 12:26:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:07,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:07,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:07,105 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -563850919, now seen corresponding path program 7 times [2019-12-18 12:26:07,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:07,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034690821] [2019-12-18 12:26:07,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:07,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034690821] [2019-12-18 12:26:07,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:07,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:26:07,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697790766] [2019-12-18 12:26:07,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:26:07,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:26:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:26:07,286 INFO L87 Difference]: Start difference. First operand 31595 states and 95341 transitions. Second operand 12 states. [2019-12-18 12:26:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:08,352 INFO L93 Difference]: Finished difference Result 54618 states and 163910 transitions. [2019-12-18 12:26:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:26:08,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:26:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:08,428 INFO L225 Difference]: With dead ends: 54618 [2019-12-18 12:26:08,429 INFO L226 Difference]: Without dead ends: 54182 [2019-12-18 12:26:08,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:26:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54182 states. [2019-12-18 12:26:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54182 to 31335. [2019-12-18 12:26:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31335 states. [2019-12-18 12:26:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31335 states to 31335 states and 94675 transitions. [2019-12-18 12:26:09,082 INFO L78 Accepts]: Start accepts. Automaton has 31335 states and 94675 transitions. Word has length 66 [2019-12-18 12:26:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:09,082 INFO L462 AbstractCegarLoop]: Abstraction has 31335 states and 94675 transitions. [2019-12-18 12:26:09,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:26:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 31335 states and 94675 transitions. [2019-12-18 12:26:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:09,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:09,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:09,114 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2147462405, now seen corresponding path program 8 times [2019-12-18 12:26:09,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:09,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298788816] [2019-12-18 12:26:09,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:09,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298788816] [2019-12-18 12:26:09,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:09,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:09,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600715039] [2019-12-18 12:26:09,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:09,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:09,166 INFO L87 Difference]: Start difference. First operand 31335 states and 94675 transitions. Second operand 3 states. [2019-12-18 12:26:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:09,252 INFO L93 Difference]: Finished difference Result 31334 states and 94673 transitions. [2019-12-18 12:26:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:09,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:26:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:09,295 INFO L225 Difference]: With dead ends: 31334 [2019-12-18 12:26:09,295 INFO L226 Difference]: Without dead ends: 31334 [2019-12-18 12:26:09,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31334 states. [2019-12-18 12:26:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31334 to 22791. [2019-12-18 12:26:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22791 states. [2019-12-18 12:26:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 70500 transitions. [2019-12-18 12:26:09,730 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 70500 transitions. Word has length 66 [2019-12-18 12:26:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:09,731 INFO L462 AbstractCegarLoop]: Abstraction has 22791 states and 70500 transitions. [2019-12-18 12:26:09,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 70500 transitions. [2019-12-18 12:26:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:09,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:09,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:09,758 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:09,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:09,758 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 1 times [2019-12-18 12:26:09,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:09,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176527094] [2019-12-18 12:26:09,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:09,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:26:09,869 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:26:09,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t269~0.base_33|) (= v_~y~0_18 0) (= |v_ULTIMATE.start_main_~#t269~0.offset_23| 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t269~0.base_33| 4) |v_#length_21|) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t269~0.base_33|) 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_33|) |v_ULTIMATE.start_main_~#t269~0.offset_23| 0)) |v_#memory_int_19|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t269~0.base_33| 1) |v_#valid_63|) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_19|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t269~0.base=|v_ULTIMATE.start_main_~#t269~0.base_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t269~0.offset=|v_ULTIMATE.start_main_~#t269~0.offset_23|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_25|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t270~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_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_~#t271~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t271~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t269~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t269~0.offset, ULTIMATE.start_main_~#t270~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:26:09,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:26:09,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t270~0.base_12| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t270~0.base_12| 0)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t270~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t270~0.offset_10|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12| 1) |v_#valid_34|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12|) |v_ULTIMATE.start_main_~#t270~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t270~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t270~0.base, #length] because there is no mapped edge [2019-12-18 12:26:09,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t271~0.base_12| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12|) |v_ULTIMATE.start_main_~#t271~0.offset_10| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t271~0.offset_10|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t271~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t271~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t271~0.base, ULTIMATE.start_main_~#t271~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:26:09,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-967658984 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-967658984 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-967658984| ~a$w_buff1~0_In-967658984) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-967658984| ~a~0_In-967658984)))) InVars {~a~0=~a~0_In-967658984, ~a$w_buff1~0=~a$w_buff1~0_In-967658984, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-967658984, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-967658984} OutVars{~a~0=~a~0_In-967658984, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-967658984|, ~a$w_buff1~0=~a$w_buff1~0_In-967658984, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-967658984, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-967658984} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:26:09,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:26:09,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1242228913 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1242228913 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1242228913|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1242228913| ~a$w_buff0_used~0_In1242228913)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1242228913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242228913} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1242228913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242228913, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1242228913|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:26:09,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-2112792561 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2112792561 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2112792561 |P0Thread1of1ForFork1_#t~ite5_Out-2112792561|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-2112792561|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2112792561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2112792561} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2112792561|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2112792561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2112792561} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:26:09,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In546151555 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In546151555 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In546151555 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In546151555 256)))) (or (and (= ~a$w_buff1_used~0_In546151555 |P0Thread1of1ForFork1_#t~ite6_Out546151555|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out546151555|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In546151555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In546151555, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In546151555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In546151555} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out546151555|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In546151555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In546151555, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In546151555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In546151555} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:26:09,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1537003674 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1537003674 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1537003674 ~a$r_buff0_thd1~0_In1537003674)) (and (= ~a$r_buff0_thd1~0_Out1537003674 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1537003674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1537003674} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1537003674|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1537003674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1537003674} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:26:09,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1958266497 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1958266497 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1958266497 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1958266497 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1958266497| ~a$r_buff1_thd1~0_In-1958266497) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1958266497|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1958266497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1958266497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1958266497, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1958266497} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1958266497|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1958266497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1958266497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1958266497, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1958266497} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:26:09,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:26:09,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In502185524 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In502185524 256)))) (or (and .cse0 (= (mod ~a$r_buff1_thd3~0_In502185524 256) 0)) (= (mod ~a$w_buff0_used~0_In502185524 256) 0) (and .cse0 (= (mod ~a$w_buff1_used~0_In502185524 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite20_Out502185524| ~a$w_buff0~0_In502185524) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out502185524| |P2Thread1of1ForFork0_#t~ite20_Out502185524|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In502185524| |P2Thread1of1ForFork0_#t~ite20_Out502185524|) (= |P2Thread1of1ForFork0_#t~ite21_Out502185524| ~a$w_buff0~0_In502185524) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In502185524, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In502185524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In502185524, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In502185524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In502185524, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In502185524|, ~weak$$choice2~0=~weak$$choice2~0_In502185524} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out502185524|, ~a$w_buff0~0=~a$w_buff0~0_In502185524, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In502185524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In502185524, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In502185524, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out502185524|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In502185524, ~weak$$choice2~0=~weak$$choice2~0_In502185524} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:26:09,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In155242225 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out155242225| ~a$w_buff0_used~0_In155242225) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In155242225| |P2Thread1of1ForFork0_#t~ite26_Out155242225|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out155242225| ~a$w_buff0_used~0_In155242225) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In155242225 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In155242225 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In155242225 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In155242225 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out155242225| |P2Thread1of1ForFork0_#t~ite26_Out155242225|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In155242225|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In155242225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In155242225, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In155242225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In155242225, ~weak$$choice2~0=~weak$$choice2~0_In155242225} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out155242225|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out155242225|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In155242225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In155242225, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In155242225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In155242225, ~weak$$choice2~0=~weak$$choice2~0_In155242225} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:26:09,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:26:09,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:26:09,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1464999768 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1464999768| |P2Thread1of1ForFork0_#t~ite38_Out-1464999768|)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1464999768 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-1464999768| ~a~0_In-1464999768)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1464999768| ~a$w_buff1~0_In-1464999768) (not .cse0) .cse2 (not .cse1)))) InVars {~a~0=~a~0_In-1464999768, ~a$w_buff1~0=~a$w_buff1~0_In-1464999768, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1464999768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1464999768} OutVars{~a~0=~a~0_In-1464999768, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1464999768|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1464999768|, ~a$w_buff1~0=~a$w_buff1~0_In-1464999768, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1464999768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1464999768} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:26:09,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1698691646 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1698691646 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1698691646| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1698691646| ~a$w_buff0_used~0_In-1698691646) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698691646, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1698691646} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1698691646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698691646, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1698691646} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:26:09,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In1686410356 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1686410356 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1686410356 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1686410356 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1686410356| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out1686410356| ~a$w_buff1_used~0_In1686410356)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1686410356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1686410356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1686410356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1686410356} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1686410356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1686410356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1686410356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1686410356, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1686410356|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:26:09,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1553172706 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1553172706 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1553172706 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1553172706 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1553172706|)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1553172706 |P1Thread1of1ForFork2_#t~ite12_Out1553172706|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1553172706, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1553172706, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1553172706, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1553172706} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1553172706, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1553172706, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1553172706, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1553172706|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1553172706} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:26:09,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1020714341 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1020714341 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1020714341| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1020714341| ~a$r_buff0_thd2~0_In-1020714341)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1020714341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1020714341} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1020714341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1020714341, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1020714341|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:26:09,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-743395262 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-743395262 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-743395262 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-743395262 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-743395262| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-743395262| ~a$r_buff1_thd2~0_In-743395262) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-743395262, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-743395262, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-743395262, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-743395262} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-743395262, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-743395262, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-743395262, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-743395262, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-743395262|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:26:09,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:26:09,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1057156084 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1057156084 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1057156084| ~a$r_buff0_thd3~0_In-1057156084) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1057156084|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1057156084, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1057156084} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1057156084, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1057156084, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1057156084|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:26:09,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In534980829 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In534980829 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In534980829 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In534980829 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out534980829|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In534980829 |P2Thread1of1ForFork0_#t~ite43_Out534980829|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In534980829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In534980829, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In534980829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In534980829} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out534980829|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In534980829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In534980829, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In534980829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In534980829} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:26:09,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:26:09,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:26:09,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1982130098 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1982130098 256)))) (or (and (= ~a~0_In-1982130098 |ULTIMATE.start_main_#t~ite47_Out-1982130098|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-1982130098 |ULTIMATE.start_main_#t~ite47_Out-1982130098|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1982130098, ~a$w_buff1~0=~a$w_buff1~0_In-1982130098, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1982130098, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1982130098} OutVars{~a~0=~a~0_In-1982130098, ~a$w_buff1~0=~a$w_buff1~0_In-1982130098, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1982130098|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1982130098, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1982130098} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:26:09,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:26:09,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1089387926 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1089387926 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1089387926| ~a$w_buff0_used~0_In1089387926)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1089387926| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1089387926, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1089387926} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1089387926, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1089387926|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1089387926} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:26:09,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-506836052 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-506836052 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-506836052 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-506836052 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-506836052| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-506836052 |ULTIMATE.start_main_#t~ite50_Out-506836052|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-506836052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-506836052, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-506836052, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-506836052} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-506836052|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-506836052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-506836052, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-506836052, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-506836052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:26:09,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1568829789 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1568829789 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1568829789|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-1568829789 |ULTIMATE.start_main_#t~ite51_Out-1568829789|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1568829789, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1568829789} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1568829789|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1568829789, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1568829789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:26:09,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-190460908 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-190460908 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-190460908 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-190460908 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-190460908| ~a$r_buff1_thd0~0_In-190460908)) (and (= |ULTIMATE.start_main_#t~ite52_Out-190460908| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-190460908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-190460908, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-190460908, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-190460908} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-190460908|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-190460908, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-190460908, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-190460908, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-190460908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:26:09,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:26:09,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:26:09 BasicIcfg [2019-12-18 12:26:09,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:26:09,994 INFO L168 Benchmark]: Toolchain (without parser) took 146753.48 ms. Allocated memory was 143.7 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,994 INFO L168 Benchmark]: CDTParser took 1.58 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.73 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 152.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,995 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 146.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,995 INFO L168 Benchmark]: RCFGBuilder took 890.42 ms. Allocated memory is still 200.8 MB. Free memory was 146.7 MB in the beginning and 96.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,996 INFO L168 Benchmark]: TraceAbstraction took 144950.78 ms. Allocated memory was 200.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 95.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:09,998 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.58 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.73 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 152.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.02 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 146.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 890.42 ms. Allocated memory is still 200.8 MB. Free memory was 146.7 MB in the beginning and 96.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144950.78 ms. Allocated memory was 200.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 95.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L841] FCALL, FORK 0 pthread_create(&t271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 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) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.6s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11481 SDtfs, 17090 SDslu, 43358 SDs, 0 SdLazy, 21472 SolverSat, 841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 103 SyntacticMatches, 26 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2505 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred 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: 59.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 842950 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2035 NumberOfCodeBlocks, 2035 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 432408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...