/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:54:02,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:54:02,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:54:02,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:54:02,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:54:02,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:54:02,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:54:02,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:54:02,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:54:02,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:54:02,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:54:02,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:54:02,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:54:02,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:54:02,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:54:02,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:54:02,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:54:02,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:54:02,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:54:02,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:54:02,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:54:02,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:54:02,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:54:02,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:54:02,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:54:02,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:54:02,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:54:02,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:54:02,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:54:02,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:54:02,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:54:02,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:54:02,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:54:02,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:54:02,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:54:02,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:54:02,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:54:02,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:54:02,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:54:02,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:54:02,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:54:02,880 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-SemanticLbe.epf [2019-12-27 02:54:02,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:54:02,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:54:02,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:54:02,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:54:02,900 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:54:02,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:54:02,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:54:02,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:54:02,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:54:02,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:54:02,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:54:02,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:54:02,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:54:02,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:54:02,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:54:02,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:54:02,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:54:02,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:54:02,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:54:02,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:54:02,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:54:02,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:54:02,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:54:02,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:54:03,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:54:03,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:54:03,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:54:03,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:54:03,186 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:54:03,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-27 02:54:03,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcefb4dc/a20b5100b8e34627bb92364acca3bf5c/FLAG76ec812d3 [2019-12-27 02:54:03,776 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:54:03,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-27 02:54:03,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcefb4dc/a20b5100b8e34627bb92364acca3bf5c/FLAG76ec812d3 [2019-12-27 02:54:04,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcefb4dc/a20b5100b8e34627bb92364acca3bf5c [2019-12-27 02:54:04,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:54:04,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:54:04,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:54:04,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:54:04,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:54:04,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04, skipping insertion in model container [2019-12-27 02:54:04,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:54:04,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:54:04,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:54:04,684 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:54:04,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:54:04,836 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:54:04,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04 WrapperNode [2019-12-27 02:54:04,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:54:04,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:54:04,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:54:04,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:54:04,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:54:04,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:54:04,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:54:04,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:54:04,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (1/1) ... [2019-12-27 02:54:04,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:54:04,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:54:04,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:54:04,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:54:04,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (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 02:54:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:54:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:54:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:54:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:54:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:54:05,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:54:05,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:54:05,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:54:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:54:05,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:54:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:54:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:54:05,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:54:05,007 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 02:54:05,796 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:54:05,797 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:54:05,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:54:05 BoogieIcfgContainer [2019-12-27 02:54:05,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:54:05,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:54:05,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:54:05,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:54:05,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:54:04" (1/3) ... [2019-12-27 02:54:05,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fd528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:54:05, skipping insertion in model container [2019-12-27 02:54:05,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:54:04" (2/3) ... [2019-12-27 02:54:05,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@169fd528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:54:05, skipping insertion in model container [2019-12-27 02:54:05,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:54:05" (3/3) ... [2019-12-27 02:54:05,807 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.oepc.i [2019-12-27 02:54:05,818 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:54:05,818 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:54:05,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:54:05,827 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:54:05,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,906 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,907 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,924 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,925 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:05,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:54:06,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:54:06,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:54:06,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:54:06,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:54:06,049 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:54:06,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:54:06,049 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:54:06,049 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:54:06,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:54:06,064 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 02:54:06,066 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:54:06,177 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:54:06,178 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:54:06,197 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:54:06,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:54:06,320 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:54:06,320 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:54:06,336 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:54:06,363 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:54:06,364 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:54:12,035 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:54:12,166 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:54:12,511 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 02:54:12,511 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:54:12,515 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 02:54:31,338 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 02:54:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 02:54:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:54:31,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:31,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:54:31,346 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 02:54:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 02:54:31,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:31,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207036085] [2019-12-27 02:54:31,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:31,555 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 02:54:31,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207036085] [2019-12-27 02:54:31,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:31,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:54:31,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253177188] [2019-12-27 02:54:31,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:54:31,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:54:31,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:54:31,581 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 02:54:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:33,218 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 02:54:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:54:33,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:54:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:33,843 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 02:54:33,843 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 02:54:33,846 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 02:54:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 02:54:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 02:54:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 02:54:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 02:54:47,502 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 02:54:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:47,502 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 02:54:47,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:54:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 02:54:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:54:47,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:47,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:54:47,508 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 02:54:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 02:54:47,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:47,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832127026] [2019-12-27 02:54:47,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:54:47,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832127026] [2019-12-27 02:54:47,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:54:47,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74562389] [2019-12-27 02:54:47,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:47,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:47,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:47,602 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 02:54:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:48,725 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 02:54:48,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:54:48,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:54:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:54,170 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 02:54:54,170 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 02:54:54,171 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 02:54:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 02:55:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 02:55:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 02:55:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 02:55:01,681 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 02:55:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:01,681 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 02:55:01,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:55:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 02:55:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:55:01,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:01,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:55:01,691 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 02:55:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 02:55:01,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:01,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883700016] [2019-12-27 02:55:01,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:01,767 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 02:55:01,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883700016] [2019-12-27 02:55:01,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:01,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:55:01,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126272691] [2019-12-27 02:55:01,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:01,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:01,770 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 02:55:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:01,888 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 02:55:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:01,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:55:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:01,991 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 02:55:01,991 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 02:55:01,991 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 02:55:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 02:55:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 02:55:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 02:55:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 02:55:06,872 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 02:55:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:06,872 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 02:55:06,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 02:55:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:55:06,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:06,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:55:06,877 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 02:55:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 02:55:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:06,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247039819] [2019-12-27 02:55:06,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:06,979 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 02:55:06,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247039819] [2019-12-27 02:55:06,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:06,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:06,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529954084] [2019-12-27 02:55:06,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:55:06,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:06,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:55:06,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:55:06,981 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 02:55:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:07,441 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 02:55:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:55:07,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:55:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:07,520 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 02:55:07,521 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 02:55:07,521 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 02:55:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 02:55:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 02:55:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 02:55:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 02:55:08,220 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 02:55:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:08,221 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 02:55:08,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:55:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 02:55:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:55:08,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:08,232 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 02:55:08,232 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 02:55:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 02:55:08,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:08,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388201290] [2019-12-27 02:55:08,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:08,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388201290] [2019-12-27 02:55:08,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:08,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:55:08,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750986173] [2019-12-27 02:55:08,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:55:08,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:55:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:55:08,362 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 02:55:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:09,530 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 02:55:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:55:09,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:55:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:09,614 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 02:55:09,614 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 02:55:09,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:55:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 02:55:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 02:55:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 02:55:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 02:55:10,528 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 02:55:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:10,529 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 02:55:10,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:55:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 02:55:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:55:10,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:10,543 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 02:55:10,543 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 02:55:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 02:55:10,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:10,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414280186] [2019-12-27 02:55:10,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:10,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414280186] [2019-12-27 02:55:10,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:10,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:10,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351022459] [2019-12-27 02:55:10,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:55:10,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:55:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:55:10,616 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-27 02:55:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:10,689 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 02:55:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:55:10,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:55:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:10,716 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 02:55:10,717 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 02:55:10,717 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 02:55:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 02:55:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 02:55:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 02:55:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 02:55:11,338 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 02:55:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:11,339 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 02:55:11,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:55:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 02:55:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:55:11,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:11,350 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 02:55:11,350 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 02:55:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 02:55:11,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:11,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639594457] [2019-12-27 02:55:11,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:11,450 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 02:55:11,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639594457] [2019-12-27 02:55:11,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:11,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:55:11,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684741573] [2019-12-27 02:55:11,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:55:11,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:55:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:55:11,453 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 02:55:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:11,993 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 02:55:11,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:55:11,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:55:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:12,025 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 02:55:12,025 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 02:55:12,025 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 02:55:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 02:55:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 02:55:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 02:55:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 02:55:12,387 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 02:55:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:12,387 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 02:55:12,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:55:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 02:55:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:55:12,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:12,406 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 02:55:12,406 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 02:55:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 02:55:12,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:12,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715898611] [2019-12-27 02:55:12,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:12,519 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 02:55:12,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715898611] [2019-12-27 02:55:12,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:12,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:55:12,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688771099] [2019-12-27 02:55:12,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:12,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:12,522 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 02:55:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:13,752 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 02:55:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:55:13,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:55:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:13,791 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 02:55:13,792 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 02:55:13,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 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 02:55:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 02:55:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 02:55:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 02:55:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 02:55:14,106 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 02:55:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:14,107 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 02:55:14,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 02:55:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:55:14,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:14,129 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 02:55:14,129 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 02:55:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 02:55:14,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:14,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792211142] [2019-12-27 02:55:14,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:14,218 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 02:55:14,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792211142] [2019-12-27 02:55:14,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:14,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:55:14,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913806829] [2019-12-27 02:55:14,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:55:14,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:14,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:55:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:55:14,221 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-27 02:55:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:15,048 INFO L93 Difference]: Finished difference Result 23224 states and 69393 transitions. [2019-12-27 02:55:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:55:15,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:55:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:15,081 INFO L225 Difference]: With dead ends: 23224 [2019-12-27 02:55:15,081 INFO L226 Difference]: Without dead ends: 23224 [2019-12-27 02:55:15,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:55:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23224 states. [2019-12-27 02:55:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23224 to 21703. [2019-12-27 02:55:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21703 states. [2019-12-27 02:55:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21703 states to 21703 states and 65239 transitions. [2019-12-27 02:55:15,404 INFO L78 Accepts]: Start accepts. Automaton has 21703 states and 65239 transitions. Word has length 39 [2019-12-27 02:55:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:15,404 INFO L462 AbstractCegarLoop]: Abstraction has 21703 states and 65239 transitions. [2019-12-27 02:55:15,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:55:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21703 states and 65239 transitions. [2019-12-27 02:55:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:55:15,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:15,432 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 02:55:15,433 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 02:55:15,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 2 times [2019-12-27 02:55:15,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:15,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375656526] [2019-12-27 02:55:15,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:15,519 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 02:55:15,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375656526] [2019-12-27 02:55:15,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:15,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:55:15,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222068066] [2019-12-27 02:55:15,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:55:15,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:15,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:55:15,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:55:15,521 INFO L87 Difference]: Start difference. First operand 21703 states and 65239 transitions. Second operand 5 states. [2019-12-27 02:55:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:15,622 INFO L93 Difference]: Finished difference Result 20476 states and 62395 transitions. [2019-12-27 02:55:15,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:55:15,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:55:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:15,661 INFO L225 Difference]: With dead ends: 20476 [2019-12-27 02:55:15,661 INFO L226 Difference]: Without dead ends: 20476 [2019-12-27 02:55:15,661 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 02:55:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2019-12-27 02:55:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19636. [2019-12-27 02:55:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19636 states. [2019-12-27 02:55:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19636 states to 19636 states and 60128 transitions. [2019-12-27 02:55:15,982 INFO L78 Accepts]: Start accepts. Automaton has 19636 states and 60128 transitions. Word has length 39 [2019-12-27 02:55:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:15,982 INFO L462 AbstractCegarLoop]: Abstraction has 19636 states and 60128 transitions. [2019-12-27 02:55:15,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:55:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19636 states and 60128 transitions. [2019-12-27 02:55:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:16,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:16,005 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 02:55:16,006 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 02:55:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-27 02:55:16,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616854889] [2019-12-27 02:55:16,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:16,070 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 02:55:16,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616854889] [2019-12-27 02:55:16,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:16,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:16,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507310673] [2019-12-27 02:55:16,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:16,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:16,074 INFO L87 Difference]: Start difference. First operand 19636 states and 60128 transitions. Second operand 3 states. [2019-12-27 02:55:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:16,236 INFO L93 Difference]: Finished difference Result 29371 states and 90040 transitions. [2019-12-27 02:55:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:16,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:55:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:16,307 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 02:55:16,308 INFO L226 Difference]: Without dead ends: 29371 [2019-12-27 02:55:16,308 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 02:55:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29371 states. [2019-12-27 02:55:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29371 to 22257. [2019-12-27 02:55:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-27 02:55:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68986 transitions. [2019-12-27 02:55:16,900 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68986 transitions. Word has length 64 [2019-12-27 02:55:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:16,900 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68986 transitions. [2019-12-27 02:55:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68986 transitions. [2019-12-27 02:55:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:17,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:17,199 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 02:55:17,199 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 02:55:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-27 02:55:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:17,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431189384] [2019-12-27 02:55:17,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:17,316 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 02:55:17,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431189384] [2019-12-27 02:55:17,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:17,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:17,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672945187] [2019-12-27 02:55:17,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:55:17,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:55:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:55:17,319 INFO L87 Difference]: Start difference. First operand 22257 states and 68986 transitions. Second operand 4 states. [2019-12-27 02:55:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:17,467 INFO L93 Difference]: Finished difference Result 41807 states and 129823 transitions. [2019-12-27 02:55:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:55:17,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 02:55:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:17,496 INFO L225 Difference]: With dead ends: 41807 [2019-12-27 02:55:17,497 INFO L226 Difference]: Without dead ends: 20833 [2019-12-27 02:55:17,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 02:55:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-27 02:55:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 20833. [2019-12-27 02:55:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-27 02:55:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-27 02:55:17,821 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-27 02:55:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:17,822 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-27 02:55:17,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:55:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-27 02:55:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:17,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:17,851 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 02:55:17,851 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 02:55:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-27 02:55:17,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:17,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214021156] [2019-12-27 02:55:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214021156] [2019-12-27 02:55:17,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:17,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:55:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301408633] [2019-12-27 02:55:17,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:17,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:17,948 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-27 02:55:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:18,596 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-27 02:55:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:55:18,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:55:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:18,687 INFO L225 Difference]: With dead ends: 61323 [2019-12-27 02:55:18,688 INFO L226 Difference]: Without dead ends: 42147 [2019-12-27 02:55:18,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:55:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-27 02:55:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-27 02:55:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-27 02:55:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-27 02:55:19,274 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-27 02:55:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:19,275 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-27 02:55:19,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-27 02:55:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:19,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:19,299 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 02:55:19,299 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 02:55:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-27 02:55:19,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:19,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479777517] [2019-12-27 02:55:19,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:19,389 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 02:55:19,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479777517] [2019-12-27 02:55:19,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:19,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:55:19,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694106325] [2019-12-27 02:55:19,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:19,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:19,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:19,391 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-27 02:55:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:20,496 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-27 02:55:20,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:55:20,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:55:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:20,613 INFO L225 Difference]: With dead ends: 68574 [2019-12-27 02:55:20,614 INFO L226 Difference]: Without dead ends: 51641 [2019-12-27 02:55:20,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:55:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-27 02:55:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-27 02:55:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-27 02:55:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-27 02:55:21,302 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-27 02:55:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:21,303 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-27 02:55:21,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-27 02:55:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:21,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:21,332 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 02:55:21,333 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 02:55:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 4 times [2019-12-27 02:55:21,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:21,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212893312] [2019-12-27 02:55:21,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:21,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212893312] [2019-12-27 02:55:21,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:21,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:55:21,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866467538] [2019-12-27 02:55:21,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:21,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:21,430 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-27 02:55:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:21,994 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-27 02:55:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:55:21,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:55:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:22,085 INFO L225 Difference]: With dead ends: 58876 [2019-12-27 02:55:22,085 INFO L226 Difference]: Without dead ends: 51661 [2019-12-27 02:55:22,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:55:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-27 02:55:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-27 02:55:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-27 02:55:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-27 02:55:23,035 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-27 02:55:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:23,035 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-27 02:55:23,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-27 02:55:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:55:23,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:23,066 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 02:55:23,066 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 02:55:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-27 02:55:23,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:23,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978839281] [2019-12-27 02:55:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:23,133 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 02:55:23,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978839281] [2019-12-27 02:55:23,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:23,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:55:23,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741658771] [2019-12-27 02:55:23,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:23,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:23,135 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-27 02:55:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:23,300 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-27 02:55:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:23,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:55:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:23,349 INFO L225 Difference]: With dead ends: 33789 [2019-12-27 02:55:23,349 INFO L226 Difference]: Without dead ends: 33789 [2019-12-27 02:55:23,349 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 02:55:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-27 02:55:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-27 02:55:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-27 02:55:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-27 02:55:23,842 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-27 02:55:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:23,842 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-27 02:55:23,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-27 02:55:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:23,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:23,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:55:23,875 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 02:55:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-27 02:55:23,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:23,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984975653] [2019-12-27 02:55:23,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:23,934 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 02:55:23,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984975653] [2019-12-27 02:55:23,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:23,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:55:23,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280416314] [2019-12-27 02:55:23,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:55:23,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:55:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:55:23,936 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-27 02:55:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:24,307 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-27 02:55:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:55:24,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:55:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:24,376 INFO L225 Difference]: With dead ends: 45817 [2019-12-27 02:55:24,376 INFO L226 Difference]: Without dead ends: 45817 [2019-12-27 02:55:24,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:55:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-27 02:55:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-27 02:55:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-27 02:55:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-27 02:55:25,361 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-27 02:55:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:25,362 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-27 02:55:25,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:55:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-27 02:55:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:25,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:25,402 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 02:55:25,402 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 02:55:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-27 02:55:25,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:25,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639663642] [2019-12-27 02:55:25,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:25,481 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 02:55:25,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639663642] [2019-12-27 02:55:25,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:25,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:55:25,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977371809] [2019-12-27 02:55:25,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:25,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:25,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:25,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:25,483 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-27 02:55:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:26,028 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-27 02:55:26,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:55:26,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:55:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:26,146 INFO L225 Difference]: With dead ends: 69632 [2019-12-27 02:55:26,146 INFO L226 Difference]: Without dead ends: 63631 [2019-12-27 02:55:26,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:55:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-27 02:55:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-27 02:55:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-27 02:55:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-27 02:55:26,866 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-27 02:55:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:26,866 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-27 02:55:26,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-27 02:55:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:26,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:26,903 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 02:55:26,903 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 02:55:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-27 02:55:26,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:26,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603748463] [2019-12-27 02:55:26,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:27,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 02:55:27,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603748463] [2019-12-27 02:55:27,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:27,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:55:27,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257867376] [2019-12-27 02:55:27,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:27,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:27,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:27,044 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-27 02:55:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:28,200 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-27 02:55:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:55:28,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:55:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:28,261 INFO L225 Difference]: With dead ends: 44848 [2019-12-27 02:55:28,261 INFO L226 Difference]: Without dead ends: 44844 [2019-12-27 02:55:28,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:55:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-27 02:55:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-27 02:55:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-27 02:55:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-27 02:55:28,860 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-27 02:55:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:28,860 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-27 02:55:28,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-27 02:55:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:28,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:28,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:55:28,900 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 02:55:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-27 02:55:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:28,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033986982] [2019-12-27 02:55:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:28,952 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 02:55:28,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033986982] [2019-12-27 02:55:28,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:28,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:28,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263858633] [2019-12-27 02:55:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:28,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:28,954 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-27 02:55:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:29,215 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-27 02:55:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:55:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:29,280 INFO L225 Difference]: With dead ends: 43160 [2019-12-27 02:55:29,280 INFO L226 Difference]: Without dead ends: 43160 [2019-12-27 02:55:29,280 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 02:55:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-27 02:55:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-27 02:55:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-27 02:55:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-27 02:55:29,869 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-27 02:55:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:29,869 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-27 02:55:29,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-27 02:55:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:29,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:29,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:55:29,909 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 02:55:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-27 02:55:29,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:29,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399665306] [2019-12-27 02:55:29,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:30,008 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 02:55:30,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399665306] [2019-12-27 02:55:30,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:30,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:55:30,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251555881] [2019-12-27 02:55:30,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:55:30,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:55:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:30,010 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-27 02:55:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:30,946 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-27 02:55:30,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:55:30,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:55:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:31,025 INFO L225 Difference]: With dead ends: 52071 [2019-12-27 02:55:31,025 INFO L226 Difference]: Without dead ends: 52071 [2019-12-27 02:55:31,026 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 02:55:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-27 02:55:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-27 02:55:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-27 02:55:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-27 02:55:31,674 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-27 02:55:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:31,674 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-27 02:55:31,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:55:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-27 02:55:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:31,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:31,721 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 02:55:31,721 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 02:55:31,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-27 02:55:31,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:31,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935698242] [2019-12-27 02:55:31,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:31,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935698242] [2019-12-27 02:55:31,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:31,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:55:31,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220916332] [2019-12-27 02:55:31,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:55:31,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:31,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:55:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:55:31,794 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-27 02:55:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:31,972 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-27 02:55:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:55:31,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:55:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:32,021 INFO L225 Difference]: With dead ends: 33507 [2019-12-27 02:55:32,022 INFO L226 Difference]: Without dead ends: 33507 [2019-12-27 02:55:32,022 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 02:55:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-27 02:55:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-27 02:55:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-27 02:55:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-27 02:55:32,481 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-27 02:55:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:32,481 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-27 02:55:32,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:55:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-27 02:55:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:32,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:32,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, 1] [2019-12-27 02:55:32,514 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 02:55:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-27 02:55:32,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:32,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108297777] [2019-12-27 02:55:32,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:32,590 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 02:55:32,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108297777] [2019-12-27 02:55:32,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:32,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:55:32,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568334629] [2019-12-27 02:55:32,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:55:32,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:32,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:55:32,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:55:32,593 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-27 02:55:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:33,287 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-27 02:55:33,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:55:33,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 02:55:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:33,389 INFO L225 Difference]: With dead ends: 40500 [2019-12-27 02:55:33,390 INFO L226 Difference]: Without dead ends: 40276 [2019-12-27 02:55:33,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:55:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-27 02:55:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-27 02:55:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-27 02:55:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-27 02:55:34,645 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-27 02:55:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:34,646 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-27 02:55:34,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:55:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-27 02:55:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:34,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:34,711 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 02:55:34,711 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 02:55:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:34,712 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-27 02:55:34,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:34,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894653519] [2019-12-27 02:55:34,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:34,954 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 02:55:34,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894653519] [2019-12-27 02:55:34,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:34,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:55:34,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867306945] [2019-12-27 02:55:34,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:55:34,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:55:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:55:34,957 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 11 states. [2019-12-27 02:55:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:37,108 INFO L93 Difference]: Finished difference Result 56386 states and 169857 transitions. [2019-12-27 02:55:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:55:37,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 02:55:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:37,193 INFO L225 Difference]: With dead ends: 56386 [2019-12-27 02:55:37,193 INFO L226 Difference]: Without dead ends: 56283 [2019-12-27 02:55:37,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:55:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56283 states. [2019-12-27 02:55:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56283 to 41025. [2019-12-27 02:55:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41025 states. [2019-12-27 02:55:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41025 states to 41025 states and 124804 transitions. [2019-12-27 02:55:37,939 INFO L78 Accepts]: Start accepts. Automaton has 41025 states and 124804 transitions. Word has length 65 [2019-12-27 02:55:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:37,939 INFO L462 AbstractCegarLoop]: Abstraction has 41025 states and 124804 transitions. [2019-12-27 02:55:37,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:55:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41025 states and 124804 transitions. [2019-12-27 02:55:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:37,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:37,984 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 02:55:37,984 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 02:55:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:37,984 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-27 02:55:37,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:37,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531349731] [2019-12-27 02:55:37,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:38,648 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 02:55:38,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531349731] [2019-12-27 02:55:38,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:38,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:55:38,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065842038] [2019-12-27 02:55:38,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:55:38,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:55:38,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:55:38,650 INFO L87 Difference]: Start difference. First operand 41025 states and 124804 transitions. Second operand 12 states. [2019-12-27 02:55:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:41,963 INFO L93 Difference]: Finished difference Result 63798 states and 191357 transitions. [2019-12-27 02:55:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 02:55:41,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 02:55:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:42,070 INFO L225 Difference]: With dead ends: 63798 [2019-12-27 02:55:42,070 INFO L226 Difference]: Without dead ends: 63490 [2019-12-27 02:55:42,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:55:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63490 states. [2019-12-27 02:55:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63490 to 41386. [2019-12-27 02:55:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-12-27 02:55:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 125486 transitions. [2019-12-27 02:55:42,902 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 125486 transitions. Word has length 65 [2019-12-27 02:55:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:42,902 INFO L462 AbstractCegarLoop]: Abstraction has 41386 states and 125486 transitions. [2019-12-27 02:55:42,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:55:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 125486 transitions. [2019-12-27 02:55:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:55:42,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:42,944 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 02:55:42,945 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 02:55:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-27 02:55:42,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:42,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437547803] [2019-12-27 02:55:42,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:43,011 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 02:55:43,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437547803] [2019-12-27 02:55:43,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:43,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:55:43,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291630962] [2019-12-27 02:55:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:43,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:43,013 INFO L87 Difference]: Start difference. First operand 41386 states and 125486 transitions. Second operand 3 states. [2019-12-27 02:55:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:43,172 INFO L93 Difference]: Finished difference Result 41386 states and 125485 transitions. [2019-12-27 02:55:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:43,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:55:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:43,232 INFO L225 Difference]: With dead ends: 41386 [2019-12-27 02:55:43,232 INFO L226 Difference]: Without dead ends: 41386 [2019-12-27 02:55:43,232 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 02:55:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41386 states. [2019-12-27 02:55:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41386 to 29884. [2019-12-27 02:55:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29884 states. [2019-12-27 02:55:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 92931 transitions. [2019-12-27 02:55:44,129 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 92931 transitions. Word has length 65 [2019-12-27 02:55:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:44,129 INFO L462 AbstractCegarLoop]: Abstraction has 29884 states and 92931 transitions. [2019-12-27 02:55:44,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 92931 transitions. [2019-12-27 02:55:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:55:44,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:44,164 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 02:55:44,164 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 02:55:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 1 times [2019-12-27 02:55:44,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:44,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79058987] [2019-12-27 02:55:44,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:44,230 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 02:55:44,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79058987] [2019-12-27 02:55:44,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:44,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:55:44,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613165965] [2019-12-27 02:55:44,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:55:44,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:44,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:55:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:55:44,232 INFO L87 Difference]: Start difference. First operand 29884 states and 92931 transitions. Second operand 3 states. [2019-12-27 02:55:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:44,323 INFO L93 Difference]: Finished difference Result 23659 states and 72294 transitions. [2019-12-27 02:55:44,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:55:44,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:55:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:44,364 INFO L225 Difference]: With dead ends: 23659 [2019-12-27 02:55:44,364 INFO L226 Difference]: Without dead ends: 23659 [2019-12-27 02:55:44,364 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 02:55:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23659 states. [2019-12-27 02:55:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23659 to 22516. [2019-12-27 02:55:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22516 states. [2019-12-27 02:55:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22516 states to 22516 states and 68726 transitions. [2019-12-27 02:55:44,698 INFO L78 Accepts]: Start accepts. Automaton has 22516 states and 68726 transitions. Word has length 66 [2019-12-27 02:55:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:44,698 INFO L462 AbstractCegarLoop]: Abstraction has 22516 states and 68726 transitions. [2019-12-27 02:55:44,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:55:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 22516 states and 68726 transitions. [2019-12-27 02:55:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:44,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:44,720 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 02:55:44,720 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 02:55:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-27 02:55:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:44,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325649513] [2019-12-27 02:55:44,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:44,889 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 02:55:44,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325649513] [2019-12-27 02:55:44,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:44,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:55:44,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934438094] [2019-12-27 02:55:44,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:55:44,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:55:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:55:44,891 INFO L87 Difference]: Start difference. First operand 22516 states and 68726 transitions. Second operand 11 states. [2019-12-27 02:55:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:46,622 INFO L93 Difference]: Finished difference Result 36805 states and 111505 transitions. [2019-12-27 02:55:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:55:46,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:55:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:46,660 INFO L225 Difference]: With dead ends: 36805 [2019-12-27 02:55:46,660 INFO L226 Difference]: Without dead ends: 27445 [2019-12-27 02:55:46,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:55:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27445 states. [2019-12-27 02:55:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27445 to 23393. [2019-12-27 02:55:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23393 states. [2019-12-27 02:55:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23393 states to 23393 states and 70793 transitions. [2019-12-27 02:55:47,014 INFO L78 Accepts]: Start accepts. Automaton has 23393 states and 70793 transitions. Word has length 67 [2019-12-27 02:55:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 23393 states and 70793 transitions. [2019-12-27 02:55:47,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:55:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 23393 states and 70793 transitions. [2019-12-27 02:55:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:47,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:47,039 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 02:55:47,039 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 02:55:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-27 02:55:47,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:47,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180852541] [2019-12-27 02:55:47,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:47,255 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 02:55:47,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180852541] [2019-12-27 02:55:47,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:47,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:55:47,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721802183] [2019-12-27 02:55:47,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:55:47,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:55:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:55:47,259 INFO L87 Difference]: Start difference. First operand 23393 states and 70793 transitions. Second operand 12 states. [2019-12-27 02:55:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:49,104 INFO L93 Difference]: Finished difference Result 30941 states and 92807 transitions. [2019-12-27 02:55:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:55:49,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:55:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:49,142 INFO L225 Difference]: With dead ends: 30941 [2019-12-27 02:55:49,143 INFO L226 Difference]: Without dead ends: 27077 [2019-12-27 02:55:49,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2019-12-27 02:55:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27077 states. [2019-12-27 02:55:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27077 to 23093. [2019-12-27 02:55:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23093 states. [2019-12-27 02:55:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23093 states to 23093 states and 69971 transitions. [2019-12-27 02:55:49,500 INFO L78 Accepts]: Start accepts. Automaton has 23093 states and 69971 transitions. Word has length 67 [2019-12-27 02:55:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:49,500 INFO L462 AbstractCegarLoop]: Abstraction has 23093 states and 69971 transitions. [2019-12-27 02:55:49,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:55:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 23093 states and 69971 transitions. [2019-12-27 02:55:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:49,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:49,527 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 02:55:49,527 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 02:55:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 3 times [2019-12-27 02:55:49,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:49,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447038145] [2019-12-27 02:55:49,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:49,822 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 02:55:49,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447038145] [2019-12-27 02:55:49,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:49,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:55:49,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439654686] [2019-12-27 02:55:49,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:55:49,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:55:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:55:49,830 INFO L87 Difference]: Start difference. First operand 23093 states and 69971 transitions. Second operand 10 states. [2019-12-27 02:55:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:50,894 INFO L93 Difference]: Finished difference Result 43774 states and 133132 transitions. [2019-12-27 02:55:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:55:50,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:55:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:50,952 INFO L225 Difference]: With dead ends: 43774 [2019-12-27 02:55:50,953 INFO L226 Difference]: Without dead ends: 41859 [2019-12-27 02:55:50,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:55:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41859 states. [2019-12-27 02:55:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41859 to 26702. [2019-12-27 02:55:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26702 states. [2019-12-27 02:55:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26702 states to 26702 states and 81160 transitions. [2019-12-27 02:55:51,440 INFO L78 Accepts]: Start accepts. Automaton has 26702 states and 81160 transitions. Word has length 67 [2019-12-27 02:55:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:51,440 INFO L462 AbstractCegarLoop]: Abstraction has 26702 states and 81160 transitions. [2019-12-27 02:55:51,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:55:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 26702 states and 81160 transitions. [2019-12-27 02:55:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:51,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:51,467 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 02:55:51,467 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 02:55:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 4 times [2019-12-27 02:55:51,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:51,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95006957] [2019-12-27 02:55:51,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:51,652 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 02:55:51,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95006957] [2019-12-27 02:55:51,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:51,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:55:51,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571738722] [2019-12-27 02:55:51,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:55:51,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:55:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:55:51,654 INFO L87 Difference]: Start difference. First operand 26702 states and 81160 transitions. Second operand 10 states. [2019-12-27 02:55:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:52,700 INFO L93 Difference]: Finished difference Result 42477 states and 128617 transitions. [2019-12-27 02:55:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:55:52,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:55:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:53,049 INFO L225 Difference]: With dead ends: 42477 [2019-12-27 02:55:53,049 INFO L226 Difference]: Without dead ends: 35723 [2019-12-27 02:55:53,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:55:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35723 states. [2019-12-27 02:55:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35723 to 22634. [2019-12-27 02:55:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22634 states. [2019-12-27 02:55:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22634 states to 22634 states and 68402 transitions. [2019-12-27 02:55:53,448 INFO L78 Accepts]: Start accepts. Automaton has 22634 states and 68402 transitions. Word has length 67 [2019-12-27 02:55:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:53,448 INFO L462 AbstractCegarLoop]: Abstraction has 22634 states and 68402 transitions. [2019-12-27 02:55:53,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:55:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22634 states and 68402 transitions. [2019-12-27 02:55:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:53,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:53,472 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 02:55:53,472 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 02:55:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 5 times [2019-12-27 02:55:53,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:53,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377503263] [2019-12-27 02:55:53,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:53,701 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 02:55:53,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377503263] [2019-12-27 02:55:53,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:53,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:55:53,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770992747] [2019-12-27 02:55:53,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:55:53,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:55:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:55:53,704 INFO L87 Difference]: Start difference. First operand 22634 states and 68402 transitions. Second operand 11 states. [2019-12-27 02:55:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:54,749 INFO L93 Difference]: Finished difference Result 37238 states and 113105 transitions. [2019-12-27 02:55:54,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:55:54,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:55:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:54,802 INFO L225 Difference]: With dead ends: 37238 [2019-12-27 02:55:54,803 INFO L226 Difference]: Without dead ends: 36219 [2019-12-27 02:55:54,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:55:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36219 states. [2019-12-27 02:55:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36219 to 23714. [2019-12-27 02:55:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23714 states. [2019-12-27 02:55:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23714 states to 23714 states and 71879 transitions. [2019-12-27 02:55:55,269 INFO L78 Accepts]: Start accepts. Automaton has 23714 states and 71879 transitions. Word has length 67 [2019-12-27 02:55:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:55,269 INFO L462 AbstractCegarLoop]: Abstraction has 23714 states and 71879 transitions. [2019-12-27 02:55:55,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:55:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 23714 states and 71879 transitions. [2019-12-27 02:55:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:55,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:55,297 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 02:55:55,297 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:55:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 961817837, now seen corresponding path program 6 times [2019-12-27 02:55:55,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:55,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358423663] [2019-12-27 02:55:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:55:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:55:55,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358423663] [2019-12-27 02:55:55,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:55:55,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:55:55,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498021102] [2019-12-27 02:55:55,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:55:55,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:55:55,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:55:55,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:55:55,496 INFO L87 Difference]: Start difference. First operand 23714 states and 71879 transitions. Second operand 11 states. [2019-12-27 02:55:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:55:56,344 INFO L93 Difference]: Finished difference Result 36674 states and 111016 transitions. [2019-12-27 02:55:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 02:55:56,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:55:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:55:56,391 INFO L225 Difference]: With dead ends: 36674 [2019-12-27 02:55:56,391 INFO L226 Difference]: Without dead ends: 34493 [2019-12-27 02:55:56,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:55:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34493 states. [2019-12-27 02:55:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34493 to 21770. [2019-12-27 02:55:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-27 02:55:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 66005 transitions. [2019-12-27 02:55:56,785 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 66005 transitions. Word has length 67 [2019-12-27 02:55:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:55:56,785 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 66005 transitions. [2019-12-27 02:55:56,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:55:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 66005 transitions. [2019-12-27 02:55:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:55:56,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:55:56,808 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 02:55:56,808 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:55:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:55:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 7 times [2019-12-27 02:55:56,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:55:56,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322076819] [2019-12-27 02:55:56,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:55:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:55:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:55:56,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:55:56,911 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:55:56,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26|)) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1391~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1391~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26|) |v_ULTIMATE.start_main_~#t1391~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1391~0.base_26|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_19|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_12|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1391~0.base=|v_ULTIMATE.start_main_~#t1391~0.base_26|, ULTIMATE.start_main_~#t1391~0.offset=|v_ULTIMATE.start_main_~#t1391~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, ULTIMATE.start_main_~#t1392~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1392~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1393~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1391~0.base, ULTIMATE.start_main_~#t1391~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:55:56,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1392~0.base_9| 4) |v_#length_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t1392~0.base_9| 0)) (= |v_ULTIMATE.start_main_~#t1392~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9|) |v_ULTIMATE.start_main_~#t1392~0.offset_8| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1392~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1392~0.offset] because there is no mapped edge [2019-12-27 02:55:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out-638289171) (= ~z$w_buff1_used~0_Out-638289171 ~z$w_buff0_used~0_In-638289171) (= ~z$w_buff1~0_Out-638289171 ~z$w_buff0~0_In-638289171) (= P0Thread1of1ForFork0_~arg.offset_Out-638289171 |P0Thread1of1ForFork0_#in~arg.offset_In-638289171|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-638289171|) (= |P0Thread1of1ForFork0_#in~arg.base_In-638289171| P0Thread1of1ForFork0_~arg.base_Out-638289171) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-638289171| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-638289171) (= 0 (mod ~z$w_buff1_used~0_Out-638289171 256)) (= ~z$w_buff0~0_Out-638289171 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-638289171|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-638289171, ~z$w_buff0~0=~z$w_buff0~0_In-638289171, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-638289171|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-638289171|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-638289171, ~z$w_buff0~0=~z$w_buff0~0_Out-638289171, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-638289171, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-638289171, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-638289171|, ~z$w_buff1~0=~z$w_buff1~0_Out-638289171, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-638289171, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-638289171|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-638289171} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:55:56,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1393~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11|) |v_ULTIMATE.start_main_~#t1393~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1393~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1393~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1393~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1393~0.base] because there is no mapped edge [2019-12-27 02:55:56,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-2133861002| |P1Thread1of1ForFork1_#t~ite10_Out-2133861002|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2133861002 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2133861002 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-2133861002| ~z~0_In-2133861002) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2133861002| ~z$w_buff1~0_In-2133861002) .cse2 (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2133861002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2133861002, ~z$w_buff1~0=~z$w_buff1~0_In-2133861002, ~z~0=~z~0_In-2133861002} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2133861002|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2133861002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2133861002, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-2133861002|, ~z$w_buff1~0=~z$w_buff1~0_In-2133861002, ~z~0=~z~0_In-2133861002} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 02:55:56,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1446542332 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1446542332 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1446542332| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1446542332| ~z$w_buff0_used~0_In-1446542332) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1446542332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1446542332|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1446542332} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:55:56,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-732280209 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-732280209 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-732280209 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-732280209 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-732280209 |P1Thread1of1ForFork1_#t~ite12_Out-732280209|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-732280209|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-732280209, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-732280209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-732280209, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-732280209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-732280209, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-732280209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-732280209, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-732280209|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-732280209} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:55:56,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-383692564 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-383692564 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-383692564| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-383692564| ~z$r_buff0_thd2~0_In-383692564) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-383692564, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-383692564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-383692564, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-383692564|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-383692564} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 02:55:56,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1147781208 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_Out-1147781208| |P2Thread1of1ForFork2_#t~ite24_Out-1147781208|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1147781208 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1147781208 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1147781208 256))) (= (mod ~z$w_buff0_used~0_In-1147781208 256) 0))) (= |P2Thread1of1ForFork2_#t~ite23_Out-1147781208| ~z$w_buff1~0_In-1147781208)) (and (= ~z$w_buff1~0_In-1147781208 |P2Thread1of1ForFork2_#t~ite24_Out-1147781208|) (= |P2Thread1of1ForFork2_#t~ite23_In-1147781208| |P2Thread1of1ForFork2_#t~ite23_Out-1147781208|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1147781208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1147781208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$w_buff1~0=~z$w_buff1~0_In-1147781208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208, ~weak$$choice2~0=~weak$$choice2~0_In-1147781208} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1147781208|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1147781208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1147781208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$w_buff1~0=~z$w_buff1~0_In-1147781208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208, ~weak$$choice2~0=~weak$$choice2~0_In-1147781208} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 02:55:56,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2115752483 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out2115752483| |P2Thread1of1ForFork2_#t~ite27_Out2115752483|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2115752483 256)))) (or (= (mod ~z$w_buff0_used~0_In2115752483 256) 0) (and (= (mod ~z$w_buff1_used~0_In2115752483 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In2115752483 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite26_Out2115752483| ~z$w_buff0_used~0_In2115752483)) (and (= |P2Thread1of1ForFork2_#t~ite26_In2115752483| |P2Thread1of1ForFork2_#t~ite26_Out2115752483|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out2115752483| ~z$w_buff0_used~0_In2115752483)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In2115752483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115752483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2115752483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115752483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2115752483, ~weak$$choice2~0=~weak$$choice2~0_In2115752483} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out2115752483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115752483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2115752483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115752483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2115752483, ~weak$$choice2~0=~weak$$choice2~0_In2115752483, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out2115752483|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 02:55:56,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In666020483 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In666020483 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In666020483 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In666020483 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out666020483| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out666020483| ~z$r_buff1_thd2~0_In666020483) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666020483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666020483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666020483, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666020483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In666020483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666020483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666020483, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out666020483|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666020483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:55:56,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:55:56,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-588693704 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-588693704| |P2Thread1of1ForFork2_#t~ite29_Out-588693704|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-588693704 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-588693704 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-588693704 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-588693704 256)))) .cse1 (= |P2Thread1of1ForFork2_#t~ite29_Out-588693704| ~z$w_buff1_used~0_In-588693704)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out-588693704| ~z$w_buff1_used~0_In-588693704) (= |P2Thread1of1ForFork2_#t~ite29_In-588693704| |P2Thread1of1ForFork2_#t~ite29_Out-588693704|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-588693704, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-588693704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-588693704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-588693704, ~weak$$choice2~0=~weak$$choice2~0_In-588693704, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-588693704|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-588693704|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-588693704, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-588693704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-588693704, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-588693704, ~weak$$choice2~0=~weak$$choice2~0_In-588693704, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-588693704|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:55:56,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:55:56,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:55:56,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1428313746 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1428313746 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1428313746| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1428313746| ~z$w_buff0_used~0_In-1428313746) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428313746} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1428313746|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428313746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:55:56,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In209018167 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In209018167 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In209018167 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In209018167 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out209018167|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In209018167 |P0Thread1of1ForFork0_#t~ite6_Out209018167|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In209018167, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In209018167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209018167, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In209018167} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out209018167|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In209018167, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In209018167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209018167, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In209018167} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:55:56,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In760834627 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In760834627 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out760834627) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In760834627 ~z$r_buff0_thd1~0_Out760834627)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In760834627, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In760834627} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In760834627, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out760834627|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out760834627} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:55:56,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In85391335 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In85391335 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In85391335 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In85391335 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In85391335 |P0Thread1of1ForFork0_#t~ite8_Out85391335|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out85391335|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In85391335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In85391335, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85391335} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out85391335|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In85391335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In85391335, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85391335} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:55:56,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:55:56,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1531736552 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1531736552 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1531736552| |P2Thread1of1ForFork2_#t~ite39_Out1531736552|))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out1531736552| ~z$w_buff1~0_In1531736552) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out1531736552| ~z~0_In1531736552) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531736552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531736552, ~z$w_buff1~0=~z$w_buff1~0_In1531736552, ~z~0=~z~0_In1531736552} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531736552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531736552, ~z$w_buff1~0=~z$w_buff1~0_In1531736552, ~z~0=~z~0_In1531736552, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1531736552|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1531736552|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 02:55:56,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In727540533 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In727540533 256)))) (or (and (= ~z$w_buff0_used~0_In727540533 |P2Thread1of1ForFork2_#t~ite40_Out727540533|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out727540533|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In727540533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In727540533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In727540533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In727540533, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out727540533|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 02:55:56,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-517342361 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-517342361 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-517342361 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-517342361 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-517342361| ~z$w_buff1_used~0_In-517342361) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-517342361| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-517342361, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-517342361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517342361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-517342361} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-517342361|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517342361, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-517342361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517342361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-517342361} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 02:55:56,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-982880399 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-982880399 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-982880399|)) (and (= ~z$r_buff0_thd3~0_In-982880399 |P2Thread1of1ForFork2_#t~ite42_Out-982880399|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-982880399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-982880399} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-982880399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-982880399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-982880399} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 02:55:56,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-266449445 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-266449445 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-266449445 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-266449445 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out-266449445| ~z$r_buff1_thd3~0_In-266449445)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out-266449445| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-266449445, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-266449445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-266449445, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266449445} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-266449445, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-266449445, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-266449445|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-266449445, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266449445} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 02:55:56,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:55:56,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:55:56,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1503604798 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1503604798 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-1503604798| |ULTIMATE.start_main_#t~ite48_Out-1503604798|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1503604798| ~z~0_In-1503604798) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1503604798| ~z$w_buff1~0_In-1503604798) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1503604798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1503604798, ~z$w_buff1~0=~z$w_buff1~0_In-1503604798, ~z~0=~z~0_In-1503604798} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1503604798, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1503604798|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1503604798, ~z$w_buff1~0=~z$w_buff1~0_In-1503604798, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1503604798|, ~z~0=~z~0_In-1503604798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:55:56,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2040053776 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2040053776 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2040053776|)) (and (= ~z$w_buff0_used~0_In-2040053776 |ULTIMATE.start_main_#t~ite49_Out-2040053776|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2040053776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2040053776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2040053776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2040053776, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2040053776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:55:56,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1309285719 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1309285719 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1309285719 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1309285719 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1309285719|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1309285719 |ULTIMATE.start_main_#t~ite50_Out1309285719|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309285719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1309285719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309285719} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1309285719|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309285719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1309285719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1309285719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:55:56,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In409026902 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In409026902 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In409026902 |ULTIMATE.start_main_#t~ite51_Out409026902|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out409026902|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409026902, ~z$w_buff0_used~0=~z$w_buff0_used~0_In409026902} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In409026902, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out409026902|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In409026902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:55:56,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In213025910 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In213025910 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In213025910 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In213025910 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out213025910|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In213025910 |ULTIMATE.start_main_#t~ite52_Out213025910|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In213025910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In213025910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In213025910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In213025910} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out213025910|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In213025910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In213025910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In213025910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In213025910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:55:56,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:55:57,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:55:57 BasicIcfg [2019-12-27 02:55:57,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:55:57,250 INFO L168 Benchmark]: Toolchain (without parser) took 113171.07 ms. Allocated memory was 137.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,250 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.39 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,251 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,256 INFO L168 Benchmark]: RCFGBuilder took 852.30 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,257 INFO L168 Benchmark]: TraceAbstraction took 111448.51 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:55:57,259 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.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.39 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.08 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.30 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111448.51 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 110.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7974 SDtfs, 9966 SDslu, 28696 SDs, 0 SdLazy, 15786 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 57 SyntacticMatches, 29 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 43.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 343401 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1797 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1697 ConstructedInterpolants, 0 QuantifiedInterpolants, 378711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...