/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:02:59,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:02:59,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:02:59,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:02:59,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:02:59,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:02:59,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:02:59,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:02:59,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:02:59,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:02:59,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:02:59,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:02:59,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:02:59,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:02:59,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:02:59,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:02:59,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:02:59,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:02:59,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:02:59,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:02:59,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:02:59,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:02:59,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:02:59,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:02:59,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:02:59,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:02:59,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:02:59,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:02:59,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:02:59,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:02:59,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:02:59,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:02:59,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:02:59,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:02:59,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:02:59,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:02:59,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:02:59,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:02:59,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:02:59,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:02:59,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:02:59,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:02:59,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:02:59,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:02:59,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:02:59,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:02:59,947 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:02:59,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:02:59,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:02:59,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:02:59,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:02:59,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:02:59,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:02:59,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:02:59,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:02:59,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:02:59,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:02:59,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:02:59,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:02:59,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:02:59,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:02:59,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:02:59,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:02:59,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:02:59,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:02:59,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:02:59,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:02:59,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:02:59,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:02:59,952 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:02:59,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:02:59,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:03:00,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:03:00,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:03:00,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:03:00,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:03:00,232 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:03:00,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-27 05:03:00,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3298fcde/dafd9ff9ff3643dfa4f52b90f6f7269f/FLAG01ead2203 [2019-12-27 05:03:00,871 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:03:00,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-27 05:03:00,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3298fcde/dafd9ff9ff3643dfa4f52b90f6f7269f/FLAG01ead2203 [2019-12-27 05:03:01,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3298fcde/dafd9ff9ff3643dfa4f52b90f6f7269f [2019-12-27 05:03:01,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:03:01,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:03:01,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:03:01,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:03:01,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:03:01,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01, skipping insertion in model container [2019-12-27 05:03:01,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:03:01,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:03:01,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:03:01,746 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:03:01,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:03:01,907 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:03:01,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01 WrapperNode [2019-12-27 05:03:01,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:03:01,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:03:01,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:03:01,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:03:01,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:03:01,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:03:01,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:03:01,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:03:01,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:01,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:02,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:02,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:02,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (1/1) ... [2019-12-27 05:03:02,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:03:02,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:03:02,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:03:02,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:03:02,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (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-27 05:03:02,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:03:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:03:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:03:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:03:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:03:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:03:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:03:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:03:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:03:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:03:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:03:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:03:02,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:03:02,103 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:03:02,863 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:03:02,864 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:03:02,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:02 BoogieIcfgContainer [2019-12-27 05:03:02,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:03:02,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:03:02,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:03:02,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:03:02,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:03:01" (1/3) ... [2019-12-27 05:03:02,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728aff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:02, skipping insertion in model container [2019-12-27 05:03:02,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:03:01" (2/3) ... [2019-12-27 05:03:02,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728aff53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:03:02, skipping insertion in model container [2019-12-27 05:03:02,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:03:02" (3/3) ... [2019-12-27 05:03:02,873 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.oepc.i [2019-12-27 05:03:02,883 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:03:02,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:03:02,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:03:02,893 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:03:02,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:03:03,038 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:03:03,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:03:03,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:03:03,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:03:03,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:03:03,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:03:03,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:03:03,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:03:03,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:03:03,077 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 05:03:03,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 05:03:03,183 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 05:03:03,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:03:03,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:03:03,226 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 05:03:03,283 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 05:03:03,283 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:03:03,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:03:03,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:03:03,321 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:03:07,022 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 05:03:07,159 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 05:03:07,280 INFO L206 etLargeBlockEncoding]: Checked pairs total: 96061 [2019-12-27 05:03:07,280 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 05:03:07,284 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 05:03:26,317 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123272 states. [2019-12-27 05:03:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 123272 states. [2019-12-27 05:03:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:03:26,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:26,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:03:26,326 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-27 05:03:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash 920016, now seen corresponding path program 1 times [2019-12-27 05:03:26,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:26,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810702559] [2019-12-27 05:03:26,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:26,560 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-27 05:03:26,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810702559] [2019-12-27 05:03:26,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:26,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:03:26,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526203311] [2019-12-27 05:03:26,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:03:26,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:03:26,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:03:26,588 INFO L87 Difference]: Start difference. First operand 123272 states. Second operand 3 states. [2019-12-27 05:03:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:29,824 INFO L93 Difference]: Finished difference Result 122274 states and 522952 transitions. [2019-12-27 05:03:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:03:29,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:03:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:30,549 INFO L225 Difference]: With dead ends: 122274 [2019-12-27 05:03:30,549 INFO L226 Difference]: Without dead ends: 115176 [2019-12-27 05:03:30,550 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-27 05:03:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115176 states. [2019-12-27 05:03:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115176 to 115176. [2019-12-27 05:03:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115176 states. [2019-12-27 05:03:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115176 states to 115176 states and 491986 transitions. [2019-12-27 05:03:40,603 INFO L78 Accepts]: Start accepts. Automaton has 115176 states and 491986 transitions. Word has length 3 [2019-12-27 05:03:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:40,604 INFO L462 AbstractCegarLoop]: Abstraction has 115176 states and 491986 transitions. [2019-12-27 05:03:40,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:03:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 115176 states and 491986 transitions. [2019-12-27 05:03:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:03:40,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:40,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:40,608 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-27 05:03:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1323565433, now seen corresponding path program 1 times [2019-12-27 05:03:40,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:40,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25390200] [2019-12-27 05:03:40,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:40,768 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-27 05:03:40,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25390200] [2019-12-27 05:03:40,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:40,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:03:40,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980118204] [2019-12-27 05:03:40,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:03:40,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:03:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:03:40,772 INFO L87 Difference]: Start difference. First operand 115176 states and 491986 transitions. Second operand 4 states. [2019-12-27 05:03:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:45,819 INFO L93 Difference]: Finished difference Result 183662 states and 752302 transitions. [2019-12-27 05:03:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:03:45,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:03:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:47,151 INFO L225 Difference]: With dead ends: 183662 [2019-12-27 05:03:47,151 INFO L226 Difference]: Without dead ends: 183613 [2019-12-27 05:03:47,152 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-27 05:03:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183613 states. [2019-12-27 05:03:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183613 to 166753. [2019-12-27 05:03:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166753 states. [2019-12-27 05:03:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166753 states to 166753 states and 692266 transitions. [2019-12-27 05:03:59,583 INFO L78 Accepts]: Start accepts. Automaton has 166753 states and 692266 transitions. Word has length 11 [2019-12-27 05:03:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:59,583 INFO L462 AbstractCegarLoop]: Abstraction has 166753 states and 692266 transitions. [2019-12-27 05:03:59,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:03:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 166753 states and 692266 transitions. [2019-12-27 05:03:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:03:59,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:59,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:59,589 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-27 05:03:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash -447069332, now seen corresponding path program 1 times [2019-12-27 05:03:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:59,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244149927] [2019-12-27 05:03:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:59,670 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-27 05:03:59,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244149927] [2019-12-27 05:03:59,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:59,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:03:59,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077986424] [2019-12-27 05:03:59,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:03:59,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:59,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:03:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:03:59,674 INFO L87 Difference]: Start difference. First operand 166753 states and 692266 transitions. Second operand 3 states. [2019-12-27 05:04:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:04,867 INFO L93 Difference]: Finished difference Result 35653 states and 116140 transitions. [2019-12-27 05:04:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:04,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:04:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:04,930 INFO L225 Difference]: With dead ends: 35653 [2019-12-27 05:04:04,930 INFO L226 Difference]: Without dead ends: 35653 [2019-12-27 05:04:04,931 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-27 05:04:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35653 states. [2019-12-27 05:04:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35653 to 35653. [2019-12-27 05:04:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35653 states. [2019-12-27 05:04:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35653 states to 35653 states and 116140 transitions. [2019-12-27 05:04:05,602 INFO L78 Accepts]: Start accepts. Automaton has 35653 states and 116140 transitions. Word has length 13 [2019-12-27 05:04:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:05,602 INFO L462 AbstractCegarLoop]: Abstraction has 35653 states and 116140 transitions. [2019-12-27 05:04:05,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 35653 states and 116140 transitions. [2019-12-27 05:04:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:04:05,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:05,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:05,606 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-27 05:04:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1594630647, now seen corresponding path program 1 times [2019-12-27 05:04:05,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:05,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078288507] [2019-12-27 05:04:05,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:05,702 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-27 05:04:05,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078288507] [2019-12-27 05:04:05,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:05,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:05,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109499738] [2019-12-27 05:04:05,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:04:05,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:05,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:04:05,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:04:05,704 INFO L87 Difference]: Start difference. First operand 35653 states and 116140 transitions. Second operand 5 states. [2019-12-27 05:04:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:06,216 INFO L93 Difference]: Finished difference Result 49040 states and 157904 transitions. [2019-12-27 05:04:06,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:04:06,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:04:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:06,305 INFO L225 Difference]: With dead ends: 49040 [2019-12-27 05:04:06,305 INFO L226 Difference]: Without dead ends: 49040 [2019-12-27 05:04:06,305 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-27 05:04:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49040 states. [2019-12-27 05:04:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49040 to 42019. [2019-12-27 05:04:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42019 states. [2019-12-27 05:04:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 136433 transitions. [2019-12-27 05:04:07,426 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 136433 transitions. Word has length 16 [2019-12-27 05:04:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:07,427 INFO L462 AbstractCegarLoop]: Abstraction has 42019 states and 136433 transitions. [2019-12-27 05:04:07,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:04:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 136433 transitions. [2019-12-27 05:04:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:04:07,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:07,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:07,439 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-27 05:04:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2124632115, now seen corresponding path program 1 times [2019-12-27 05:04:07,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:07,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725990265] [2019-12-27 05:04:07,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:07,596 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-27 05:04:07,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725990265] [2019-12-27 05:04:07,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:07,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:04:07,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699488196] [2019-12-27 05:04:07,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:04:07,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:04:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:04:07,599 INFO L87 Difference]: Start difference. First operand 42019 states and 136433 transitions. Second operand 6 states. [2019-12-27 05:04:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:08,520 INFO L93 Difference]: Finished difference Result 63228 states and 200109 transitions. [2019-12-27 05:04:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:04:08,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:04:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:08,620 INFO L225 Difference]: With dead ends: 63228 [2019-12-27 05:04:08,620 INFO L226 Difference]: Without dead ends: 63221 [2019-12-27 05:04:08,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:04:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63221 states. [2019-12-27 05:04:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63221 to 41773. [2019-12-27 05:04:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41773 states. [2019-12-27 05:04:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41773 states to 41773 states and 134916 transitions. [2019-12-27 05:04:09,748 INFO L78 Accepts]: Start accepts. Automaton has 41773 states and 134916 transitions. Word has length 22 [2019-12-27 05:04:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:09,748 INFO L462 AbstractCegarLoop]: Abstraction has 41773 states and 134916 transitions. [2019-12-27 05:04:09,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:04:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 41773 states and 134916 transitions. [2019-12-27 05:04:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:04:09,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:09,762 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-27 05:04:09,762 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-27 05:04:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1985611191, now seen corresponding path program 1 times [2019-12-27 05:04:09,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:09,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972528556] [2019-12-27 05:04:09,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:09,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972528556] [2019-12-27 05:04:09,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:09,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:09,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382289461] [2019-12-27 05:04:09,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:04:09,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:04:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:04:09,823 INFO L87 Difference]: Start difference. First operand 41773 states and 134916 transitions. Second operand 4 states. [2019-12-27 05:04:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:09,890 INFO L93 Difference]: Finished difference Result 16487 states and 50228 transitions. [2019-12-27 05:04:09,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:04:09,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:04:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:09,915 INFO L225 Difference]: With dead ends: 16487 [2019-12-27 05:04:09,915 INFO L226 Difference]: Without dead ends: 16487 [2019-12-27 05:04:09,916 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-27 05:04:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2019-12-27 05:04:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16124. [2019-12-27 05:04:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16124 states. [2019-12-27 05:04:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 49192 transitions. [2019-12-27 05:04:10,145 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 49192 transitions. Word has length 25 [2019-12-27 05:04:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:10,146 INFO L462 AbstractCegarLoop]: Abstraction has 16124 states and 49192 transitions. [2019-12-27 05:04:10,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:04:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 49192 transitions. [2019-12-27 05:04:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:04:10,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:10,157 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-27 05:04:10,157 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-27 05:04:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1670307795, now seen corresponding path program 1 times [2019-12-27 05:04:10,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:10,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722323941] [2019-12-27 05:04:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:10,209 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-27 05:04:10,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722323941] [2019-12-27 05:04:10,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:10,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:10,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962874997] [2019-12-27 05:04:10,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:10,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:10,211 INFO L87 Difference]: Start difference. First operand 16124 states and 49192 transitions. Second operand 3 states. [2019-12-27 05:04:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:10,310 INFO L93 Difference]: Finished difference Result 23364 states and 69824 transitions. [2019-12-27 05:04:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:10,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:04:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:10,340 INFO L225 Difference]: With dead ends: 23364 [2019-12-27 05:04:10,340 INFO L226 Difference]: Without dead ends: 23364 [2019-12-27 05:04:10,340 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-27 05:04:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2019-12-27 05:04:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 17891. [2019-12-27 05:04:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-27 05:04:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 54042 transitions. [2019-12-27 05:04:10,756 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 54042 transitions. Word has length 27 [2019-12-27 05:04:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:10,756 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 54042 transitions. [2019-12-27 05:04:10,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 54042 transitions. [2019-12-27 05:04:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:04:10,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:10,769 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-27 05:04:10,769 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-27 05:04:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1181786131, now seen corresponding path program 1 times [2019-12-27 05:04:10,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:10,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763924641] [2019-12-27 05:04:10,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:10,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763924641] [2019-12-27 05:04:10,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:10,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:04:10,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076091849] [2019-12-27 05:04:10,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:04:10,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:04:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:04:10,856 INFO L87 Difference]: Start difference. First operand 17891 states and 54042 transitions. Second operand 6 states. [2019-12-27 05:04:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:11,413 INFO L93 Difference]: Finished difference Result 25058 states and 73821 transitions. [2019-12-27 05:04:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:04:11,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:04:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:11,449 INFO L225 Difference]: With dead ends: 25058 [2019-12-27 05:04:11,449 INFO L226 Difference]: Without dead ends: 25058 [2019-12-27 05:04:11,449 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-27 05:04:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2019-12-27 05:04:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 20577. [2019-12-27 05:04:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20577 states. [2019-12-27 05:04:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 61791 transitions. [2019-12-27 05:04:11,777 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 61791 transitions. Word has length 27 [2019-12-27 05:04:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:11,777 INFO L462 AbstractCegarLoop]: Abstraction has 20577 states and 61791 transitions. [2019-12-27 05:04:11,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:04:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 61791 transitions. [2019-12-27 05:04:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:04:11,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:11,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] [2019-12-27 05:04:11,799 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-27 05:04:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2129802289, now seen corresponding path program 1 times [2019-12-27 05:04:11,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:11,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475140146] [2019-12-27 05:04:11,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:11,898 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-27 05:04:11,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475140146] [2019-12-27 05:04:11,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:11,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:04:11,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009143157] [2019-12-27 05:04:11,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:04:11,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:04:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:04:11,900 INFO L87 Difference]: Start difference. First operand 20577 states and 61791 transitions. Second operand 7 states. [2019-12-27 05:04:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:12,975 INFO L93 Difference]: Finished difference Result 27892 states and 81805 transitions. [2019-12-27 05:04:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:04:12,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:04:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:13,012 INFO L225 Difference]: With dead ends: 27892 [2019-12-27 05:04:13,013 INFO L226 Difference]: Without dead ends: 27892 [2019-12-27 05:04:13,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:04:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2019-12-27 05:04:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 18703. [2019-12-27 05:04:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18703 states. [2019-12-27 05:04:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18703 states to 18703 states and 56394 transitions. [2019-12-27 05:04:13,571 INFO L78 Accepts]: Start accepts. Automaton has 18703 states and 56394 transitions. Word has length 33 [2019-12-27 05:04:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:13,572 INFO L462 AbstractCegarLoop]: Abstraction has 18703 states and 56394 transitions. [2019-12-27 05:04:13,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:04:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18703 states and 56394 transitions. [2019-12-27 05:04:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:04:13,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:13,595 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-27 05:04:13,596 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-27 05:04:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -559725799, now seen corresponding path program 1 times [2019-12-27 05:04:13,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:13,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328898354] [2019-12-27 05:04:13,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:13,657 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-27 05:04:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328898354] [2019-12-27 05:04:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:13,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:04:13,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131951259] [2019-12-27 05:04:13,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:13,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:13,660 INFO L87 Difference]: Start difference. First operand 18703 states and 56394 transitions. Second operand 3 states. [2019-12-27 05:04:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:13,743 INFO L93 Difference]: Finished difference Result 18702 states and 56392 transitions. [2019-12-27 05:04:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:13,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:04:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:13,782 INFO L225 Difference]: With dead ends: 18702 [2019-12-27 05:04:13,782 INFO L226 Difference]: Without dead ends: 18702 [2019-12-27 05:04:13,782 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-27 05:04:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18702 states. [2019-12-27 05:04:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18702 to 18702. [2019-12-27 05:04:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-12-27 05:04:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 56392 transitions. [2019-12-27 05:04:14,168 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 56392 transitions. Word has length 39 [2019-12-27 05:04:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:14,168 INFO L462 AbstractCegarLoop]: Abstraction has 18702 states and 56392 transitions. [2019-12-27 05:04:14,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 56392 transitions. [2019-12-27 05:04:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:04:14,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:14,191 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-27 05:04:14,191 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-27 05:04:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1324353592, now seen corresponding path program 1 times [2019-12-27 05:04:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:14,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836872035] [2019-12-27 05:04:14,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:14,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836872035] [2019-12-27 05:04:14,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:14,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:04:14,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992683719] [2019-12-27 05:04:14,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:04:14,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:04:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:04:14,250 INFO L87 Difference]: Start difference. First operand 18702 states and 56392 transitions. Second operand 5 states. [2019-12-27 05:04:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:14,329 INFO L93 Difference]: Finished difference Result 17378 states and 53366 transitions. [2019-12-27 05:04:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:04:14,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:04:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:14,355 INFO L225 Difference]: With dead ends: 17378 [2019-12-27 05:04:14,355 INFO L226 Difference]: Without dead ends: 17378 [2019-12-27 05:04:14,355 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-27 05:04:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17378 states. [2019-12-27 05:04:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17378 to 16713. [2019-12-27 05:04:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16713 states. [2019-12-27 05:04:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16713 states to 16713 states and 51571 transitions. [2019-12-27 05:04:14,604 INFO L78 Accepts]: Start accepts. Automaton has 16713 states and 51571 transitions. Word has length 40 [2019-12-27 05:04:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:14,604 INFO L462 AbstractCegarLoop]: Abstraction has 16713 states and 51571 transitions. [2019-12-27 05:04:14,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:04:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16713 states and 51571 transitions. [2019-12-27 05:04:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:14,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:14,621 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-27 05:04:14,621 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-27 05:04:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1560507821, now seen corresponding path program 1 times [2019-12-27 05:04:14,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:14,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040124] [2019-12-27 05:04:14,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:14,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040124] [2019-12-27 05:04:14,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:14,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:14,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864924891] [2019-12-27 05:04:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:14,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:14,686 INFO L87 Difference]: Start difference. First operand 16713 states and 51571 transitions. Second operand 3 states. [2019-12-27 05:04:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:14,795 INFO L93 Difference]: Finished difference Result 22522 states and 68098 transitions. [2019-12-27 05:04:14,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:14,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:04:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:14,826 INFO L225 Difference]: With dead ends: 22522 [2019-12-27 05:04:14,826 INFO L226 Difference]: Without dead ends: 22522 [2019-12-27 05:04:14,826 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-27 05:04:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22522 states. [2019-12-27 05:04:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22522 to 16531. [2019-12-27 05:04:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-12-27 05:04:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 50417 transitions. [2019-12-27 05:04:15,099 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 50417 transitions. Word has length 64 [2019-12-27 05:04:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:15,100 INFO L462 AbstractCegarLoop]: Abstraction has 16531 states and 50417 transitions. [2019-12-27 05:04:15,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 50417 transitions. [2019-12-27 05:04:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:15,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:15,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:15,118 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-27 05:04:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1583187919, now seen corresponding path program 1 times [2019-12-27 05:04:15,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:15,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681784268] [2019-12-27 05:04:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:15,215 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-27 05:04:15,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681784268] [2019-12-27 05:04:15,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:15,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:04:15,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863898352] [2019-12-27 05:04:15,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:04:15,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:04:15,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:04:15,217 INFO L87 Difference]: Start difference. First operand 16531 states and 50417 transitions. Second operand 7 states. [2019-12-27 05:04:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:15,838 INFO L93 Difference]: Finished difference Result 48075 states and 145792 transitions. [2019-12-27 05:04:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:04:15,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:04:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:15,892 INFO L225 Difference]: With dead ends: 48075 [2019-12-27 05:04:15,892 INFO L226 Difference]: Without dead ends: 37314 [2019-12-27 05:04:15,893 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-27 05:04:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37314 states. [2019-12-27 05:04:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37314 to 20250. [2019-12-27 05:04:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20250 states. [2019-12-27 05:04:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20250 states to 20250 states and 62030 transitions. [2019-12-27 05:04:16,314 INFO L78 Accepts]: Start accepts. Automaton has 20250 states and 62030 transitions. Word has length 64 [2019-12-27 05:04:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:16,314 INFO L462 AbstractCegarLoop]: Abstraction has 20250 states and 62030 transitions. [2019-12-27 05:04:16,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:04:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20250 states and 62030 transitions. [2019-12-27 05:04:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:16,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:16,340 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-27 05:04:16,340 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-27 05:04:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 713705511, now seen corresponding path program 2 times [2019-12-27 05:04:16,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:16,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328853670] [2019-12-27 05:04:16,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:16,427 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-27 05:04:16,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328853670] [2019-12-27 05:04:16,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:16,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:04:16,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209946944] [2019-12-27 05:04:16,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:04:16,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:04:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:04:16,429 INFO L87 Difference]: Start difference. First operand 20250 states and 62030 transitions. Second operand 7 states. [2019-12-27 05:04:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:16,908 INFO L93 Difference]: Finished difference Result 55081 states and 165238 transitions. [2019-12-27 05:04:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:04:16,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:04:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:16,982 INFO L225 Difference]: With dead ends: 55081 [2019-12-27 05:04:16,982 INFO L226 Difference]: Without dead ends: 40243 [2019-12-27 05:04:16,984 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-27 05:04:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-27 05:04:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23749. [2019-12-27 05:04:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23749 states. [2019-12-27 05:04:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23749 states to 23749 states and 72556 transitions. [2019-12-27 05:04:17,486 INFO L78 Accepts]: Start accepts. Automaton has 23749 states and 72556 transitions. Word has length 64 [2019-12-27 05:04:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:17,486 INFO L462 AbstractCegarLoop]: Abstraction has 23749 states and 72556 transitions. [2019-12-27 05:04:17,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:04:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23749 states and 72556 transitions. [2019-12-27 05:04:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:17,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04: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-27 05:04:17,514 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-27 05:04:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1281034255, now seen corresponding path program 3 times [2019-12-27 05:04:17,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:17,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97466056] [2019-12-27 05:04:17,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:17,633 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-27 05:04:17,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97466056] [2019-12-27 05:04:17,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:17,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:17,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212785444] [2019-12-27 05:04:17,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:04:17,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:04:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:04:17,635 INFO L87 Difference]: Start difference. First operand 23749 states and 72556 transitions. Second operand 9 states. [2019-12-27 05:04:17,850 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 05:04:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:19,221 INFO L93 Difference]: Finished difference Result 74583 states and 224180 transitions. [2019-12-27 05:04:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:04:19,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:04:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:19,337 INFO L225 Difference]: With dead ends: 74583 [2019-12-27 05:04:19,337 INFO L226 Difference]: Without dead ends: 71960 [2019-12-27 05:04:19,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:04:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71960 states. [2019-12-27 05:04:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71960 to 23905. [2019-12-27 05:04:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-12-27 05:04:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 73218 transitions. [2019-12-27 05:04:20,059 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 73218 transitions. Word has length 64 [2019-12-27 05:04:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:20,059 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 73218 transitions. [2019-12-27 05:04:20,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:04:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 73218 transitions. [2019-12-27 05:04:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:20,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:20,084 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-27 05:04:20,085 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-27 05:04:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 229645845, now seen corresponding path program 4 times [2019-12-27 05:04:20,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:20,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769035093] [2019-12-27 05:04:20,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:20,197 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-27 05:04:20,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769035093] [2019-12-27 05:04:20,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:20,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:20,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522939756] [2019-12-27 05:04:20,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:04:20,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:04:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:04:20,201 INFO L87 Difference]: Start difference. First operand 23905 states and 73218 transitions. Second operand 9 states. [2019-12-27 05:04:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:22,028 INFO L93 Difference]: Finished difference Result 87530 states and 263304 transitions. [2019-12-27 05:04:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:04:22,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:04:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:22,147 INFO L225 Difference]: With dead ends: 87530 [2019-12-27 05:04:22,147 INFO L226 Difference]: Without dead ends: 84971 [2019-12-27 05:04:22,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:04:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84971 states. [2019-12-27 05:04:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84971 to 23942. [2019-12-27 05:04:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23942 states. [2019-12-27 05:04:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23942 states to 23942 states and 73416 transitions. [2019-12-27 05:04:22,934 INFO L78 Accepts]: Start accepts. Automaton has 23942 states and 73416 transitions. Word has length 64 [2019-12-27 05:04:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:22,934 INFO L462 AbstractCegarLoop]: Abstraction has 23942 states and 73416 transitions. [2019-12-27 05:04:22,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:04:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23942 states and 73416 transitions. [2019-12-27 05:04:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:04:22,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:22,962 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-27 05:04:22,962 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-27 05:04:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1004584677, now seen corresponding path program 5 times [2019-12-27 05:04:22,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:22,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973089670] [2019-12-27 05:04:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:23,041 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-27 05:04:23,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973089670] [2019-12-27 05:04:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:23,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:04:23,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324995397] [2019-12-27 05:04:23,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:23,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:23,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:23,043 INFO L87 Difference]: Start difference. First operand 23942 states and 73416 transitions. Second operand 3 states. [2019-12-27 05:04:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:23,185 INFO L93 Difference]: Finished difference Result 27958 states and 85579 transitions. [2019-12-27 05:04:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:23,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:04:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:23,222 INFO L225 Difference]: With dead ends: 27958 [2019-12-27 05:04:23,222 INFO L226 Difference]: Without dead ends: 27958 [2019-12-27 05:04:23,223 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-27 05:04:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27958 states. [2019-12-27 05:04:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27958 to 24839. [2019-12-27 05:04:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24839 states. [2019-12-27 05:04:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24839 states to 24839 states and 76379 transitions. [2019-12-27 05:04:23,617 INFO L78 Accepts]: Start accepts. Automaton has 24839 states and 76379 transitions. Word has length 64 [2019-12-27 05:04:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:23,617 INFO L462 AbstractCegarLoop]: Abstraction has 24839 states and 76379 transitions. [2019-12-27 05:04:23,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24839 states and 76379 transitions. [2019-12-27 05:04:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:23,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:23,899 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-27 05:04:23,899 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-27 05:04:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1684524284, now seen corresponding path program 1 times [2019-12-27 05:04:23,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:23,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272932631] [2019-12-27 05:04:23,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:23,948 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-27 05:04:23,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272932631] [2019-12-27 05:04:23,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:23,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:23,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938815622] [2019-12-27 05:04:23,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:23,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:23,955 INFO L87 Difference]: Start difference. First operand 24839 states and 76379 transitions. Second operand 3 states. [2019-12-27 05:04:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:24,205 INFO L93 Difference]: Finished difference Result 35237 states and 109044 transitions. [2019-12-27 05:04:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:24,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:04:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:24,254 INFO L225 Difference]: With dead ends: 35237 [2019-12-27 05:04:24,254 INFO L226 Difference]: Without dead ends: 35237 [2019-12-27 05:04:24,254 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-27 05:04:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35237 states. [2019-12-27 05:04:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35237 to 25614. [2019-12-27 05:04:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25614 states. [2019-12-27 05:04:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25614 states to 25614 states and 78777 transitions. [2019-12-27 05:04:24,717 INFO L78 Accepts]: Start accepts. Automaton has 25614 states and 78777 transitions. Word has length 65 [2019-12-27 05:04:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:24,718 INFO L462 AbstractCegarLoop]: Abstraction has 25614 states and 78777 transitions. [2019-12-27 05:04:24,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25614 states and 78777 transitions. [2019-12-27 05:04:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:24,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:24,748 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-27 05:04:24,748 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-27 05:04:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash -488620722, now seen corresponding path program 2 times [2019-12-27 05:04:24,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:24,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548899362] [2019-12-27 05:04:24,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:24,836 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-27 05:04:24,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548899362] [2019-12-27 05:04:24,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:24,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:04:24,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531484927] [2019-12-27 05:04:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:04:24,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:04:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:04:24,839 INFO L87 Difference]: Start difference. First operand 25614 states and 78777 transitions. Second operand 8 states. [2019-12-27 05:04:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:25,768 INFO L93 Difference]: Finished difference Result 65096 states and 196585 transitions. [2019-12-27 05:04:25,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:04:25,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:04:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:25,849 INFO L225 Difference]: With dead ends: 65096 [2019-12-27 05:04:25,850 INFO L226 Difference]: Without dead ends: 61374 [2019-12-27 05:04:25,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:04:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61374 states. [2019-12-27 05:04:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61374 to 25710. [2019-12-27 05:04:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25710 states. [2019-12-27 05:04:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25710 states to 25710 states and 79169 transitions. [2019-12-27 05:04:26,807 INFO L78 Accepts]: Start accepts. Automaton has 25710 states and 79169 transitions. Word has length 65 [2019-12-27 05:04:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:26,807 INFO L462 AbstractCegarLoop]: Abstraction has 25710 states and 79169 transitions. [2019-12-27 05:04:26,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:04:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 25710 states and 79169 transitions. [2019-12-27 05:04:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:26,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:26,834 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-27 05:04:26,834 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-27 05:04:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash -635720392, now seen corresponding path program 3 times [2019-12-27 05:04:26,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:26,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925719796] [2019-12-27 05:04:26,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:26,949 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-27 05:04:26,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925719796] [2019-12-27 05:04:26,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:26,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:26,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551126665] [2019-12-27 05:04:26,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:04:26,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:04:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:04:26,951 INFO L87 Difference]: Start difference. First operand 25710 states and 79169 transitions. Second operand 9 states. [2019-12-27 05:04:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:28,225 INFO L93 Difference]: Finished difference Result 74768 states and 223790 transitions. [2019-12-27 05:04:28,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:04:28,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:04:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:28,323 INFO L225 Difference]: With dead ends: 74768 [2019-12-27 05:04:28,324 INFO L226 Difference]: Without dead ends: 71046 [2019-12-27 05:04:28,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:04:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71046 states. [2019-12-27 05:04:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71046 to 25732. [2019-12-27 05:04:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25732 states. [2019-12-27 05:04:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 79240 transitions. [2019-12-27 05:04:29,056 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 79240 transitions. Word has length 65 [2019-12-27 05:04:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 25732 states and 79240 transitions. [2019-12-27 05:04:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:04:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 79240 transitions. [2019-12-27 05:04:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:29,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:29,084 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-27 05:04:29,084 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-27 05:04:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash -548803762, now seen corresponding path program 4 times [2019-12-27 05:04:29,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:29,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399088840] [2019-12-27 05:04:29,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:29,192 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-27 05:04:29,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399088840] [2019-12-27 05:04:29,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:29,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:29,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081793363] [2019-12-27 05:04:29,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:04:29,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:04:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:04:29,195 INFO L87 Difference]: Start difference. First operand 25732 states and 79240 transitions. Second operand 9 states. [2019-12-27 05:04:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:30,987 INFO L93 Difference]: Finished difference Result 83320 states and 248854 transitions. [2019-12-27 05:04:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:04:30,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:04:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:31,104 INFO L225 Difference]: With dead ends: 83320 [2019-12-27 05:04:31,104 INFO L226 Difference]: Without dead ends: 79637 [2019-12-27 05:04:31,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:04:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79637 states. [2019-12-27 05:04:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79637 to 25613. [2019-12-27 05:04:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25613 states. [2019-12-27 05:04:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25613 states to 25613 states and 78657 transitions. [2019-12-27 05:04:31,853 INFO L78 Accepts]: Start accepts. Automaton has 25613 states and 78657 transitions. Word has length 65 [2019-12-27 05:04:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:31,853 INFO L462 AbstractCegarLoop]: Abstraction has 25613 states and 78657 transitions. [2019-12-27 05:04:31,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:04:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 25613 states and 78657 transitions. [2019-12-27 05:04:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:31,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:31,880 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-27 05:04:31,880 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-27 05:04:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 281637962, now seen corresponding path program 5 times [2019-12-27 05:04:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181345922] [2019-12-27 05:04:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:31,971 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-27 05:04:31,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181345922] [2019-12-27 05:04:31,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:31,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:04:31,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624520163] [2019-12-27 05:04:31,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:04:31,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:31,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:04:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:04:31,973 INFO L87 Difference]: Start difference. First operand 25613 states and 78657 transitions. Second operand 7 states. [2019-12-27 05:04:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:32,552 INFO L93 Difference]: Finished difference Result 43202 states and 133802 transitions. [2019-12-27 05:04:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:04:32,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:04:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:32,615 INFO L225 Difference]: With dead ends: 43202 [2019-12-27 05:04:32,615 INFO L226 Difference]: Without dead ends: 43202 [2019-12-27 05:04:32,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:04:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43202 states. [2019-12-27 05:04:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43202 to 29457. [2019-12-27 05:04:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29457 states. [2019-12-27 05:04:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 91574 transitions. [2019-12-27 05:04:33,485 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 91574 transitions. Word has length 65 [2019-12-27 05:04:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:33,486 INFO L462 AbstractCegarLoop]: Abstraction has 29457 states and 91574 transitions. [2019-12-27 05:04:33,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:04:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 91574 transitions. [2019-12-27 05:04:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:04:33,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:33,518 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-27 05:04:33,518 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-27 05:04:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash 943176243, now seen corresponding path program 1 times [2019-12-27 05:04:33,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:33,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672513903] [2019-12-27 05:04:33,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:33,580 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-27 05:04:33,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672513903] [2019-12-27 05:04:33,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:33,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:04:33,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200923632] [2019-12-27 05:04:33,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:33,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:33,584 INFO L87 Difference]: Start difference. First operand 29457 states and 91574 transitions. Second operand 3 states. [2019-12-27 05:04:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:33,716 INFO L93 Difference]: Finished difference Result 29456 states and 91572 transitions. [2019-12-27 05:04:33,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:33,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:04:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:33,768 INFO L225 Difference]: With dead ends: 29456 [2019-12-27 05:04:33,768 INFO L226 Difference]: Without dead ends: 29456 [2019-12-27 05:04:33,769 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-27 05:04:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29456 states. [2019-12-27 05:04:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29456 to 25746. [2019-12-27 05:04:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25746 states. [2019-12-27 05:04:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25746 states to 25746 states and 81239 transitions. [2019-12-27 05:04:34,207 INFO L78 Accepts]: Start accepts. Automaton has 25746 states and 81239 transitions. Word has length 65 [2019-12-27 05:04:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:34,207 INFO L462 AbstractCegarLoop]: Abstraction has 25746 states and 81239 transitions. [2019-12-27 05:04:34,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25746 states and 81239 transitions. [2019-12-27 05:04:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:04:34,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:34,237 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-27 05:04:34,237 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-27 05:04:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -25266104, now seen corresponding path program 1 times [2019-12-27 05:04:34,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:34,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321530289] [2019-12-27 05:04:34,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:34,304 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-27 05:04:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321530289] [2019-12-27 05:04:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:04:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630378179] [2019-12-27 05:04:34,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:34,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:34,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:34,306 INFO L87 Difference]: Start difference. First operand 25746 states and 81239 transitions. Second operand 3 states. [2019-12-27 05:04:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:34,430 INFO L93 Difference]: Finished difference Result 22149 states and 68447 transitions. [2019-12-27 05:04:34,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:34,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:04:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:34,479 INFO L225 Difference]: With dead ends: 22149 [2019-12-27 05:04:34,479 INFO L226 Difference]: Without dead ends: 22149 [2019-12-27 05:04:34,480 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-27 05:04:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22149 states. [2019-12-27 05:04:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22149 to 20157. [2019-12-27 05:04:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20157 states. [2019-12-27 05:04:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20157 states to 20157 states and 62255 transitions. [2019-12-27 05:04:34,955 INFO L78 Accepts]: Start accepts. Automaton has 20157 states and 62255 transitions. Word has length 66 [2019-12-27 05:04:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:34,956 INFO L462 AbstractCegarLoop]: Abstraction has 20157 states and 62255 transitions. [2019-12-27 05:04:34,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20157 states and 62255 transitions. [2019-12-27 05:04:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:34,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:34,977 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-27 05:04:34,978 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-27 05:04:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash -271477992, now seen corresponding path program 1 times [2019-12-27 05:04:34,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:34,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501580866] [2019-12-27 05:04:34,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:35,095 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-27 05:04:35,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501580866] [2019-12-27 05:04:35,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:35,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:35,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847191442] [2019-12-27 05:04:35,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:04:35,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:04:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:04:35,097 INFO L87 Difference]: Start difference. First operand 20157 states and 62255 transitions. Second operand 9 states. [2019-12-27 05:04:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:36,544 INFO L93 Difference]: Finished difference Result 38396 states and 117495 transitions. [2019-12-27 05:04:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:04:36,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 05:04:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:36,589 INFO L225 Difference]: With dead ends: 38396 [2019-12-27 05:04:36,589 INFO L226 Difference]: Without dead ends: 32347 [2019-12-27 05:04:36,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:04:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32347 states. [2019-12-27 05:04:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32347 to 20775. [2019-12-27 05:04:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20775 states. [2019-12-27 05:04:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20775 states to 20775 states and 63719 transitions. [2019-12-27 05:04:37,158 INFO L78 Accepts]: Start accepts. Automaton has 20775 states and 63719 transitions. Word has length 67 [2019-12-27 05:04:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:37,158 INFO L462 AbstractCegarLoop]: Abstraction has 20775 states and 63719 transitions. [2019-12-27 05:04:37,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:04:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20775 states and 63719 transitions. [2019-12-27 05:04:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:37,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:37,181 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-27 05:04:37,181 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-27 05:04:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -147249512, now seen corresponding path program 2 times [2019-12-27 05:04:37,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:37,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131443711] [2019-12-27 05:04:37,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:37,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131443711] [2019-12-27 05:04:37,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:37,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:04:37,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346157054] [2019-12-27 05:04:37,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:04:37,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:04:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:04:37,338 INFO L87 Difference]: Start difference. First operand 20775 states and 63719 transitions. Second operand 8 states. [2019-12-27 05:04:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:38,913 INFO L93 Difference]: Finished difference Result 43277 states and 133968 transitions. [2019-12-27 05:04:38,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:04:38,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 05:04:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:38,974 INFO L225 Difference]: With dead ends: 43277 [2019-12-27 05:04:38,974 INFO L226 Difference]: Without dead ends: 43277 [2019-12-27 05:04:38,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:04:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43277 states. [2019-12-27 05:04:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43277 to 22680. [2019-12-27 05:04:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22680 states. [2019-12-27 05:04:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22680 states to 22680 states and 70263 transitions. [2019-12-27 05:04:39,455 INFO L78 Accepts]: Start accepts. Automaton has 22680 states and 70263 transitions. Word has length 67 [2019-12-27 05:04:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:39,455 INFO L462 AbstractCegarLoop]: Abstraction has 22680 states and 70263 transitions. [2019-12-27 05:04:39,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:04:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22680 states and 70263 transitions. [2019-12-27 05:04:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:39,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:39,477 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-27 05:04:39,477 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-27 05:04:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1579680440, now seen corresponding path program 3 times [2019-12-27 05:04:39,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:39,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293395658] [2019-12-27 05:04:39,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:39,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293395658] [2019-12-27 05:04:39,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:39,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:39,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758480658] [2019-12-27 05:04:39,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:04:39,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:04:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:04:39,539 INFO L87 Difference]: Start difference. First operand 22680 states and 70263 transitions. Second operand 4 states. [2019-12-27 05:04:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:39,694 INFO L93 Difference]: Finished difference Result 22495 states and 69540 transitions. [2019-12-27 05:04:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:04:39,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 05:04:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:39,734 INFO L225 Difference]: With dead ends: 22495 [2019-12-27 05:04:39,735 INFO L226 Difference]: Without dead ends: 22495 [2019-12-27 05:04:39,735 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-27 05:04:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2019-12-27 05:04:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 16215. [2019-12-27 05:04:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16215 states. [2019-12-27 05:04:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16215 states to 16215 states and 48849 transitions. [2019-12-27 05:04:40,013 INFO L78 Accepts]: Start accepts. Automaton has 16215 states and 48849 transitions. Word has length 67 [2019-12-27 05:04:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:40,013 INFO L462 AbstractCegarLoop]: Abstraction has 16215 states and 48849 transitions. [2019-12-27 05:04:40,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:04:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 16215 states and 48849 transitions. [2019-12-27 05:04:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:40,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:40,029 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-27 05:04:40,029 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-27 05:04:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash -887039031, now seen corresponding path program 1 times [2019-12-27 05:04:40,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:40,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776608454] [2019-12-27 05:04:40,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:40,171 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-27 05:04:40,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776608454] [2019-12-27 05:04:40,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:40,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:04:40,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690204926] [2019-12-27 05:04:40,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:04:40,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:04:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:04:40,173 INFO L87 Difference]: Start difference. First operand 16215 states and 48849 transitions. Second operand 11 states. [2019-12-27 05:04:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:41,652 INFO L93 Difference]: Finished difference Result 21341 states and 63937 transitions. [2019-12-27 05:04:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:04:41,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:04:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:41,678 INFO L225 Difference]: With dead ends: 21341 [2019-12-27 05:04:41,678 INFO L226 Difference]: Without dead ends: 19786 [2019-12-27 05:04:41,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:04:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19786 states. [2019-12-27 05:04:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19786 to 16308. [2019-12-27 05:04:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16308 states. [2019-12-27 05:04:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16308 states to 16308 states and 49080 transitions. [2019-12-27 05:04:41,936 INFO L78 Accepts]: Start accepts. Automaton has 16308 states and 49080 transitions. Word has length 67 [2019-12-27 05:04:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:41,936 INFO L462 AbstractCegarLoop]: Abstraction has 16308 states and 49080 transitions. [2019-12-27 05:04:41,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:04:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16308 states and 49080 transitions. [2019-12-27 05:04:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:41,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:41,952 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-27 05:04:41,952 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-27 05:04:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash 882845507, now seen corresponding path program 2 times [2019-12-27 05:04:41,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:41,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716534730] [2019-12-27 05:04:41,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:42,121 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-27 05:04:42,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716534730] [2019-12-27 05:04:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:42,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:04:42,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088694031] [2019-12-27 05:04:42,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:04:42,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:04:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:04:42,123 INFO L87 Difference]: Start difference. First operand 16308 states and 49080 transitions. Second operand 11 states. [2019-12-27 05:04:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:43,179 INFO L93 Difference]: Finished difference Result 33269 states and 99476 transitions. [2019-12-27 05:04:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 05:04:43,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:04:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:43,224 INFO L225 Difference]: With dead ends: 33269 [2019-12-27 05:04:43,224 INFO L226 Difference]: Without dead ends: 31354 [2019-12-27 05:04:43,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 05:04:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31354 states. [2019-12-27 05:04:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31354 to 18424. [2019-12-27 05:04:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18424 states. [2019-12-27 05:04:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 55304 transitions. [2019-12-27 05:04:43,576 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 55304 transitions. Word has length 67 [2019-12-27 05:04:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:43,576 INFO L462 AbstractCegarLoop]: Abstraction has 18424 states and 55304 transitions. [2019-12-27 05:04:43,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:04:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 55304 transitions. [2019-12-27 05:04:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:43,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:43,593 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-27 05:04:43,593 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-27 05:04:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash 792018787, now seen corresponding path program 3 times [2019-12-27 05:04:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:43,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764690036] [2019-12-27 05:04:43,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:43,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764690036] [2019-12-27 05:04:43,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:43,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:04:43,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997131817] [2019-12-27 05:04:43,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:04:43,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:04:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:04:43,793 INFO L87 Difference]: Start difference. First operand 18424 states and 55304 transitions. Second operand 11 states. [2019-12-27 05:04:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:44,788 INFO L93 Difference]: Finished difference Result 31890 states and 94870 transitions. [2019-12-27 05:04:44,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:04:44,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:04:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:44,824 INFO L225 Difference]: With dead ends: 31890 [2019-12-27 05:04:44,824 INFO L226 Difference]: Without dead ends: 26905 [2019-12-27 05:04:44,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:04:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26905 states. [2019-12-27 05:04:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26905 to 15374. [2019-12-27 05:04:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15374 states. [2019-12-27 05:04:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15374 states to 15374 states and 46195 transitions. [2019-12-27 05:04:45,294 INFO L78 Accepts]: Start accepts. Automaton has 15374 states and 46195 transitions. Word has length 67 [2019-12-27 05:04:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:45,294 INFO L462 AbstractCegarLoop]: Abstraction has 15374 states and 46195 transitions. [2019-12-27 05:04:45,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:04:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15374 states and 46195 transitions. [2019-12-27 05:04:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:45,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:45,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 05:04:45,308 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-27 05:04:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411945, now seen corresponding path program 4 times [2019-12-27 05:04:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:45,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247028978] [2019-12-27 05:04:45,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:45,454 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-27 05:04:45,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247028978] [2019-12-27 05:04:45,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:45,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:04:45,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653098771] [2019-12-27 05:04:45,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:04:45,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:04:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:04:45,456 INFO L87 Difference]: Start difference. First operand 15374 states and 46195 transitions. Second operand 11 states. [2019-12-27 05:04:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:46,323 INFO L93 Difference]: Finished difference Result 26874 states and 80074 transitions. [2019-12-27 05:04:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:04:46,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:04:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:46,359 INFO L225 Difference]: With dead ends: 26874 [2019-12-27 05:04:46,359 INFO L226 Difference]: Without dead ends: 26655 [2019-12-27 05:04:46,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:04:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26655 states. [2019-12-27 05:04:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26655 to 15198. [2019-12-27 05:04:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15198 states. [2019-12-27 05:04:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15198 states to 15198 states and 45711 transitions. [2019-12-27 05:04:46,646 INFO L78 Accepts]: Start accepts. Automaton has 15198 states and 45711 transitions. Word has length 67 [2019-12-27 05:04:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:46,647 INFO L462 AbstractCegarLoop]: Abstraction has 15198 states and 45711 transitions. [2019-12-27 05:04:46,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:04:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15198 states and 45711 transitions. [2019-12-27 05:04:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:46,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:46,661 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-27 05:04:46,661 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-27 05:04:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash 56904589, now seen corresponding path program 5 times [2019-12-27 05:04:46,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:46,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938556576] [2019-12-27 05:04:46,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:04:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:04:46,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:04:46,777 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:04:46,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t56~0.offset_18|) (= 0 v_~a$mem_tmp~0_9) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23|) |v_ULTIMATE.start_main_~#t56~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff0_used~0_114) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t56~0.base_23| 4) |v_#length_23|) (= 0 v_~a$w_buff0~0_27) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a$flush_delayed~0_12 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t56~0.base_23|) (= 0 v_~z~0_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~a$r_buff0_thd0~0_18 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= v_~a$r_buff0_thd1~0_23 0) (= v_~a$r_buff0_thd3~0_75 0) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23|)) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_18) (= 0 v_~a$r_buff1_thd3~0_47) (= v_~a~0_27 0) (= 0 v_~x~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_15|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t56~0.offset=|v_ULTIMATE.start_main_~#t56~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_8, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_23|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t56~0.base=|v_ULTIMATE.start_main_~#t56~0.base_23|} 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, ULTIMATE.start_main_~#t58~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t57~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t58~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t56~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t57~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__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, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t56~0.base] because there is no mapped edge [2019-12-27 05:04:46,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2_#in~arg.base_In578524441| P0Thread1of1ForFork2_~arg.base_Out578524441) (= ~a$w_buff0_used~0_Out578524441 1) (= P0Thread1of1ForFork2_~arg.offset_Out578524441 |P0Thread1of1ForFork2_#in~arg.offset_In578524441|) (= ~a$w_buff0~0_Out578524441 1) (= (mod ~a$w_buff1_used~0_Out578524441 256) 0) (= ~a$w_buff0_used~0_In578524441 ~a$w_buff1_used~0_Out578524441) (= ~a$w_buff1~0_Out578524441 ~a$w_buff0~0_In578524441) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out578524441| 1) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out578524441| P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out578524441)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In578524441|, ~a$w_buff0~0=~a$w_buff0~0_In578524441, ~a$w_buff0_used~0=~a$w_buff0_used~0_In578524441, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In578524441|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out578524441, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In578524441|, ~a$w_buff0~0=~a$w_buff0~0_Out578524441, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out578524441, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out578524441, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out578524441, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In578524441|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out578524441, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out578524441, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out578524441|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:04:46,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t57~0.base_13| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13|) |v_ULTIMATE.start_main_~#t57~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t57~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t57~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t57~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t57~0.offset, ULTIMATE.start_main_~#t57~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:04:46,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In863777432 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out863777432| |P1Thread1of1ForFork0_#t~ite9_Out863777432|)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In863777432 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In863777432 |P1Thread1of1ForFork0_#t~ite9_Out863777432|) .cse2) (and (not .cse0) .cse2 (= |P1Thread1of1ForFork0_#t~ite9_Out863777432| ~a$w_buff1~0_In863777432) (not .cse1)))) InVars {~a~0=~a~0_In863777432, ~a$w_buff1~0=~a$w_buff1~0_In863777432, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In863777432, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863777432} OutVars{~a~0=~a~0_In863777432, ~a$w_buff1~0=~a$w_buff1~0_In863777432, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out863777432|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In863777432, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out863777432|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863777432} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 05:04:46,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-847144324 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-847144324 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-847144324|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-847144324| ~a$w_buff0_used~0_In-847144324)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-847144324, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-847144324} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-847144324, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-847144324|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-847144324} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 05:04:46,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1000724481 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1000724481 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1000724481 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1000724481 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite12_Out-1000724481| ~a$w_buff1_used~0_In-1000724481)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1000724481| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1000724481, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1000724481, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1000724481, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1000724481} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1000724481, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1000724481, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1000724481|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1000724481, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1000724481} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 05:04:46,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1211804607 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1211804607 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite13_Out1211804607| ~a$r_buff0_thd2~0_In1211804607) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out1211804607| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1211804607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1211804607} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1211804607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1211804607, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1211804607|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 05:04:46,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-2141597326 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-2141597326 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2141597326 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-2141597326 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-2141597326| ~a$r_buff1_thd2~0_In-2141597326) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out-2141597326| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2141597326, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2141597326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2141597326, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141597326} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2141597326, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2141597326, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2141597326, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-2141597326|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141597326} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 05:04:46,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~a$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 05:04:46,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L844-1-->L846: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12|) |v_ULTIMATE.start_main_~#t58~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t58~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t58~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t58~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t58~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t58~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t58~0.base] because there is no mapped edge [2019-12-27 05:04:46,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In765025418 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out765025418| ~a$w_buff0~0_In765025418) (= |P2Thread1of1ForFork1_#t~ite20_In765025418| |P2Thread1of1ForFork1_#t~ite20_Out765025418|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In765025418 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In765025418 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In765025418 256)) (and (= (mod ~a$r_buff1_thd3~0_In765025418 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite21_Out765025418| |P2Thread1of1ForFork1_#t~ite20_Out765025418|) (= ~a$w_buff0~0_In765025418 |P2Thread1of1ForFork1_#t~ite20_Out765025418|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In765025418|, ~a$w_buff0~0=~a$w_buff0~0_In765025418, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In765025418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In765025418, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In765025418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In765025418, ~weak$$choice2~0=~weak$$choice2~0_In765025418} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out765025418|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out765025418|, ~a$w_buff0~0=~a$w_buff0~0_In765025418, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In765025418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In765025418, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In765025418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In765025418, ~weak$$choice2~0=~weak$$choice2~0_In765025418} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:04:46,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1074102179 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In-1074102179| |P2Thread1of1ForFork1_#t~ite26_Out-1074102179|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out-1074102179| ~a$w_buff0_used~0_In-1074102179)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1074102179 256)))) (or (= (mod ~a$w_buff0_used~0_In-1074102179 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1074102179 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1074102179 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite27_Out-1074102179| |P2Thread1of1ForFork1_#t~ite26_Out-1074102179|) (= |P2Thread1of1ForFork1_#t~ite26_Out-1074102179| ~a$w_buff0_used~0_In-1074102179) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1074102179|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1074102179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1074102179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1074102179, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1074102179, ~weak$$choice2~0=~weak$$choice2~0_In-1074102179} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1074102179|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1074102179|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1074102179, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1074102179, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1074102179, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1074102179, ~weak$$choice2~0=~weak$$choice2~0_In-1074102179} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 05:04:46,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 05:04:46,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:04:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1238738503 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1238738503 256) 0))) (or (and (= ~a~0_In1238738503 |P2Thread1of1ForFork1_#t~ite38_Out1238738503|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In1238738503 |P2Thread1of1ForFork1_#t~ite38_Out1238738503|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1238738503, ~a$w_buff1~0=~a$w_buff1~0_In1238738503, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1238738503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1238738503} OutVars{~a~0=~a~0_In1238738503, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1238738503|, ~a$w_buff1~0=~a$w_buff1~0_In1238738503, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1238738503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1238738503} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 05:04:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 05:04:46,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-376751199 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-376751199 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-376751199|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-376751199 |P2Thread1of1ForFork1_#t~ite40_Out-376751199|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-376751199, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-376751199} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-376751199, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-376751199, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-376751199|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 05:04:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In765515901 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In765515901 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In765515901 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In765515901 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out765515901|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In765515901 |P2Thread1of1ForFork1_#t~ite41_Out765515901|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In765515901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In765515901, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In765515901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In765515901} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In765515901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In765515901, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In765515901, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out765515901|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In765515901} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 05:04:46,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-871659153 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-871659153 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-871659153|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-871659153| ~a$r_buff0_thd3~0_In-871659153)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-871659153, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-871659153} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-871659153|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-871659153, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-871659153} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 05:04:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In2136950417 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2136950417 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In2136950417 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In2136950417 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out2136950417| ~a$r_buff1_thd3~0_In2136950417) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out2136950417| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136950417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2136950417, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2136950417, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136950417} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out2136950417|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136950417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2136950417, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2136950417, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136950417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 05:04:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~a$r_buff1_thd3~0_40 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 05:04:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-946367375 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-946367375 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out-946367375| ~a$w_buff0_used~0_In-946367375) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out-946367375| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-946367375, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-946367375} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-946367375|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-946367375, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-946367375} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 05:04:46,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1047688612 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1047688612 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1047688612 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1047688612 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out1047688612|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out1047688612| ~a$w_buff1_used~0_In1047688612)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1047688612, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1047688612, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1047688612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1047688612} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1047688612, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1047688612|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1047688612, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1047688612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1047688612} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 05:04:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1974482806 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1974482806 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In1974482806 ~a$r_buff0_thd1~0_Out1974482806)) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out1974482806) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1974482806, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1974482806} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1974482806|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1974482806, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1974482806} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:04:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In800430150 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In800430150 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In800430150 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In800430150 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out800430150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite8_Out800430150| ~a$r_buff1_thd1~0_In800430150)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In800430150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In800430150, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In800430150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In800430150} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out800430150|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In800430150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In800430150, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In800430150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In800430150} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 05:04:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_8| v_~a$r_buff1_thd1~0_10)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:04:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:04:46,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-753679617 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-753679617 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-753679617 |ULTIMATE.start_main_#t~ite47_Out-753679617|) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In-753679617 |ULTIMATE.start_main_#t~ite47_Out-753679617|)))) InVars {~a~0=~a~0_In-753679617, ~a$w_buff1~0=~a$w_buff1~0_In-753679617, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-753679617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-753679617} OutVars{~a~0=~a~0_In-753679617, ~a$w_buff1~0=~a$w_buff1~0_In-753679617, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-753679617|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-753679617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-753679617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:04:46,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_22 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, 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-27 05:04:46,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1320621553 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1320621553 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1320621553|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1320621553 |ULTIMATE.start_main_#t~ite49_Out1320621553|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1320621553, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1320621553} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1320621553, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1320621553|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1320621553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:04:46,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-2021683046 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-2021683046 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2021683046 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2021683046 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-2021683046 |ULTIMATE.start_main_#t~ite50_Out-2021683046|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-2021683046|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2021683046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2021683046, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2021683046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2021683046} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2021683046|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2021683046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2021683046, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2021683046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2021683046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:04:46,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1582192016 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1582192016 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1582192016|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1582192016 |ULTIMATE.start_main_#t~ite51_Out1582192016|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1582192016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1582192016} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1582192016|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1582192016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1582192016} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:04:46,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1890438818 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1890438818 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1890438818 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1890438818 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1890438818|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd0~0_In-1890438818 |ULTIMATE.start_main_#t~ite52_Out-1890438818|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1890438818, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1890438818, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1890438818, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1890438818} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1890438818|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1890438818, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1890438818, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1890438818, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1890438818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:04:46,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_14)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-27 05:04:46,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:46 BasicIcfg [2019-12-27 05:04:46,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:04:46,894 INFO L168 Benchmark]: Toolchain (without parser) took 105767.37 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,894 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.21 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.14 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,896 INFO L168 Benchmark]: Boogie Preprocessor took 50.52 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,896 INFO L168 Benchmark]: RCFGBuilder took 840.59 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 101.0 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,897 INFO L168 Benchmark]: TraceAbstraction took 104026.16 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:04:46,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.21 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.14 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.52 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.59 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 101.0 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104026.16 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 7307 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 96061 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t56, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_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=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t57, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L760] 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) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 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 [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t58, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L807] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L807] 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) [L808] 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)) [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L809] 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)) [L810] 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)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L811] 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)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_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] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8299 SDtfs, 12027 SDslu, 29325 SDs, 0 SdLazy, 11923 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 47 SyntacticMatches, 17 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166753occurred 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: 38.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 459169 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1632 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1534 ConstructedInterpolants, 0 QuantifiedInterpolants, 300158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...