/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:09:10,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:09:10,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:09:10,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:09:10,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:09:10,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:09:10,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:09:10,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:09:10,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:09:10,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:09:10,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:09:10,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:09:10,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:09:10,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:09:10,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:09:10,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:09:10,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:09:10,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:09:10,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:09:10,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:09:10,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:09:10,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:09:10,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:09:10,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:09:10,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:09:10,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:09:10,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:09:10,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:09:10,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:09:10,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:09:10,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:09:10,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:09:10,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:09:10,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:09:10,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:09:10,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:09:10,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:09:10,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:09:10,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:09:10,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:09:10,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:09:10,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:09:10,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:09:10,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:09:10,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:09:10,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:09:10,950 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:09:10,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:09:10,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:09:10,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:09:10,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:09:10,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:09:10,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:09:10,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:09:10,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:09:10,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:09:10,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:09:10,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:09:10,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:09:10,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:09:10,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:09:10,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:09:10,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:09:10,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:09:10,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:09:10,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:09:10,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:09:10,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:09:10,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:09:10,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:09:10,955 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:09:10,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:09:11,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:09:11,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:09:11,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:09:11,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:09:11,249 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:09:11,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-26 21:09:11,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb23b056/6f478864d74248af8ca04cc89e544d71/FLAG5ba397496 [2019-12-26 21:09:11,850 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:09:11,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-26 21:09:11,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb23b056/6f478864d74248af8ca04cc89e544d71/FLAG5ba397496 [2019-12-26 21:09:12,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb23b056/6f478864d74248af8ca04cc89e544d71 [2019-12-26 21:09:12,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:09:12,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:09:12,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:12,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:09:12,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:09:12,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:12,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12, skipping insertion in model container [2019-12-26 21:09:12,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:12,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:09:12,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:09:12,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:12,805 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:09:12,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:12,967 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:09:12,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12 WrapperNode [2019-12-26 21:09:12,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:12,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:12,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:09:12,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:09:12,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:13,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:09:13,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:09:13,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:09:13,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... [2019-12-26 21:09:13,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:09:13,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:09:13,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:09:13,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:09:13,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:09:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:09:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:09:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:09:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:09:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:09:13,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:09:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:09:13,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:09:13,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:09:13,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:09:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:09:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:09:13,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:09:13,167 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:09:13,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:09:13,896 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:09:13,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:13 BoogieIcfgContainer [2019-12-26 21:09:13,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:09:13,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:09:13,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:09:13,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:09:13,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:09:12" (1/3) ... [2019-12-26 21:09:13,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c982a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:13, skipping insertion in model container [2019-12-26 21:09:13,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:12" (2/3) ... [2019-12-26 21:09:13,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c982a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:13, skipping insertion in model container [2019-12-26 21:09:13,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:13" (3/3) ... [2019-12-26 21:09:13,910 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-26 21:09:13,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:09:13,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:09:13,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:09:13,929 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:09:13,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:13,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,063 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:14,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:09:14,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:09:14,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:09:14,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:09:14,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:09:14,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:09:14,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:09:14,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:09:14,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:09:14,137 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-26 21:09:14,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:09:14,243 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:09:14,244 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:14,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:09:14,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:09:14,340 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:09:14,340 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:14,349 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:09:14,370 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:09:14,372 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:09:19,735 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:09:19,883 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:09:20,075 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-26 21:09:20,075 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 21:09:20,080 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-26 21:09:38,842 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:09:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:09:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:09:38,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:38,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:09:38,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:38,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-26 21:09:38,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:38,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980423273] [2019-12-26 21:09:38,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:09:39,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980423273] [2019-12-26 21:09:39,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:39,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:09:39,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609720369] [2019-12-26 21:09:39,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:09:39,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:09:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:39,118 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:09:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:40,149 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-26 21:09:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:09:40,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:09:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:09:43,876 INFO L225 Difference]: With dead ends: 119349 [2019-12-26 21:09:43,876 INFO L226 Difference]: Without dead ends: 112420 [2019-12-26 21:09:43,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:09:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-26 21:09:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-26 21:09:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-26 21:09:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-26 21:09:54,377 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-26 21:09:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:09:54,377 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-26 21:09:54,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:09:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-26 21:09:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:09:54,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:09:54,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:09:54,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:09:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:09:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-26 21:09:54,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:09:54,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089672181] [2019-12-26 21:09:54,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:09:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:09:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:09:54,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089672181] [2019-12-26 21:09:54,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:09:54,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:09:54,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180413704] [2019-12-26 21:09:54,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:09:54,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:09:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:09:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:09:54,494 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-26 21:09:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:09:59,553 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-26 21:09:59,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:09:59,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:09:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:00,238 INFO L225 Difference]: With dead ends: 179210 [2019-12-26 21:10:00,238 INFO L226 Difference]: Without dead ends: 179161 [2019-12-26 21:10:00,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-26 21:10:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-26 21:10:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-26 21:10:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-26 21:10:17,796 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-26 21:10:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:17,797 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-26 21:10:17,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:10:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-26 21:10:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:10:17,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:17,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:17,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-26 21:10:17,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:17,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946436887] [2019-12-26 21:10:17,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:17,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946436887] [2019-12-26 21:10:17,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:17,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:17,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330489990] [2019-12-26 21:10:17,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:17,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:17,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:17,879 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-26 21:10:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:18,005 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-26 21:10:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:18,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:10:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:18,059 INFO L225 Difference]: With dead ends: 34811 [2019-12-26 21:10:18,060 INFO L226 Difference]: Without dead ends: 34811 [2019-12-26 21:10:18,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-26 21:10:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-26 21:10:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-26 21:10:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-26 21:10:18,690 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-26 21:10:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:18,690 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-26 21:10:18,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-26 21:10:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:10:18,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:18,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:18,694 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-26 21:10:18,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:18,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553535987] [2019-12-26 21:10:18,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:18,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553535987] [2019-12-26 21:10:18,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:18,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:18,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336518055] [2019-12-26 21:10:18,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:10:18,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:10:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:18,801 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-26 21:10:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:21,279 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-26 21:10:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:10:21,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:10:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:21,351 INFO L225 Difference]: With dead ends: 48236 [2019-12-26 21:10:21,352 INFO L226 Difference]: Without dead ends: 48236 [2019-12-26 21:10:21,352 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-26 21:10:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-26 21:10:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-26 21:10:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-26 21:10:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-26 21:10:22,092 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-26 21:10:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:22,094 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-26 21:10:22,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:10:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-26 21:10:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:10:22,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:22,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:22,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-26 21:10:22,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:22,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870643960] [2019-12-26 21:10:22,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:22,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870643960] [2019-12-26 21:10:22,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:22,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:10:22,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522698696] [2019-12-26 21:10:22,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:10:22,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:10:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:10:22,236 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-26 21:10:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:23,456 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-26 21:10:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:10:23,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:10:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:23,560 INFO L225 Difference]: With dead ends: 62182 [2019-12-26 21:10:23,560 INFO L226 Difference]: Without dead ends: 62175 [2019-12-26 21:10:23,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:10:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-26 21:10:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-26 21:10:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-26 21:10:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-26 21:10:24,440 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-26 21:10:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-26 21:10:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:10:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-26 21:10:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:10:24,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:24,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:24,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-26 21:10:24,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:24,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759868499] [2019-12-26 21:10:24,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759868499] [2019-12-26 21:10:24,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:24,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:24,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601958604] [2019-12-26 21:10:24,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:10:24,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:10:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:10:24,526 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-26 21:10:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:24,588 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-26 21:10:24,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:10:24,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:10:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:24,612 INFO L225 Difference]: With dead ends: 16196 [2019-12-26 21:10:24,613 INFO L226 Difference]: Without dead ends: 16196 [2019-12-26 21:10:24,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:10:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-26 21:10:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-26 21:10:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-26 21:10:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-26 21:10:24,875 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-26 21:10:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:24,876 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-26 21:10:24,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:10:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-26 21:10:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:10:24,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:24,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:24,888 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-26 21:10:24,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:24,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538751686] [2019-12-26 21:10:24,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:25,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538751686] [2019-12-26 21:10:25,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:25,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828210041] [2019-12-26 21:10:25,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:25,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:25,245 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-26 21:10:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:25,350 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-26 21:10:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:25,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:10:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:25,383 INFO L225 Difference]: With dead ends: 23073 [2019-12-26 21:10:25,383 INFO L226 Difference]: Without dead ends: 23073 [2019-12-26 21:10:25,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-26 21:10:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-26 21:10:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-26 21:10:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-26 21:10:25,696 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-26 21:10:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:25,697 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-26 21:10:25,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-26 21:10:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:10:25,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:25,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:25,709 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-26 21:10:25,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:25,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906043304] [2019-12-26 21:10:25,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:25,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906043304] [2019-12-26 21:10:25,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:25,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:10:25,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995103976] [2019-12-26 21:10:25,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:10:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:10:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:10:25,796 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-26 21:10:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:26,328 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-26 21:10:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:10:26,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:10:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:26,366 INFO L225 Difference]: With dead ends: 24767 [2019-12-26 21:10:26,367 INFO L226 Difference]: Without dead ends: 24767 [2019-12-26 21:10:26,367 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-26 21:10:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-26 21:10:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-26 21:10:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-26 21:10:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-26 21:10:26,715 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-26 21:10:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:26,715 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-26 21:10:26,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:10:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-26 21:10:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:10:26,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:26,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:26,738 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-26 21:10:26,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:26,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885223562] [2019-12-26 21:10:26,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:26,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885223562] [2019-12-26 21:10:26,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:26,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:10:26,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462664265] [2019-12-26 21:10:26,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:10:26,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:10:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:10:26,842 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-26 21:10:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:28,096 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-26 21:10:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:10:28,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:10:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:28,138 INFO L225 Difference]: With dead ends: 27601 [2019-12-26 21:10:28,138 INFO L226 Difference]: Without dead ends: 27601 [2019-12-26 21:10:28,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:10:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-26 21:10:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-26 21:10:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-26 21:10:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-26 21:10:28,699 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-26 21:10:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:28,699 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-26 21:10:28,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:10:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-26 21:10:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:10:28,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:28,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:28,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-26 21:10:28,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810411604] [2019-12-26 21:10:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:28,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810411604] [2019-12-26 21:10:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:28,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:10:28,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689358185] [2019-12-26 21:10:28,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:28,788 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-26 21:10:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:28,859 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-26 21:10:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:28,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:10:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:28,884 INFO L225 Difference]: With dead ends: 18411 [2019-12-26 21:10:28,885 INFO L226 Difference]: Without dead ends: 18411 [2019-12-26 21:10:28,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-26 21:10:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-26 21:10:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-26 21:10:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-26 21:10:29,168 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-26 21:10:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-26 21:10:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-26 21:10:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:10:29,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:29,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:29,192 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-26 21:10:29,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:29,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215390232] [2019-12-26 21:10:29,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:29,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215390232] [2019-12-26 21:10:29,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:29,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:29,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156566323] [2019-12-26 21:10:29,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:29,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:29,296 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-26 21:10:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:29,391 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-26 21:10:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:29,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:10:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:29,431 INFO L225 Difference]: With dead ends: 18325 [2019-12-26 21:10:29,432 INFO L226 Difference]: Without dead ends: 18325 [2019-12-26 21:10:29,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-26 21:10:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-26 21:10:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-26 21:10:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-26 21:10:29,844 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-26 21:10:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:29,844 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-26 21:10:29,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-26 21:10:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:10:29,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:29,861 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] [2019-12-26 21:10:29,862 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-26 21:10:29,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:29,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265860903] [2019-12-26 21:10:29,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:29,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265860903] [2019-12-26 21:10:29,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:29,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:10:29,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4446991] [2019-12-26 21:10:29,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:10:29,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:29,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:10:29,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:29,927 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-26 21:10:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:30,006 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-26 21:10:30,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:10:30,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:10:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:30,036 INFO L225 Difference]: With dead ends: 15143 [2019-12-26 21:10:30,036 INFO L226 Difference]: Without dead ends: 15143 [2019-12-26 21:10:30,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-26 21:10:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-26 21:10:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-26 21:10:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-26 21:10:30,382 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-26 21:10:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:30,382 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-26 21:10:30,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:10:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-26 21:10:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:30,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:30,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:30,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-26 21:10:30,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:30,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615995179] [2019-12-26 21:10:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:30,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615995179] [2019-12-26 21:10:30,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:30,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:30,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679910988] [2019-12-26 21:10:30,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:30,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:30,683 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-26 21:10:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:30,796 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-26 21:10:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:30,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:10:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:30,839 INFO L225 Difference]: With dead ends: 19655 [2019-12-26 21:10:30,839 INFO L226 Difference]: Without dead ends: 19655 [2019-12-26 21:10:30,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-26 21:10:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-26 21:10:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-26 21:10:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-26 21:10:31,314 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-26 21:10:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:31,314 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-26 21:10:31,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-26 21:10:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:31,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:31,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:31,342 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-26 21:10:31,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:31,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477465115] [2019-12-26 21:10:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:31,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477465115] [2019-12-26 21:10:31,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:31,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:10:31,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743586247] [2019-12-26 21:10:31,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:10:31,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:10:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:10:31,481 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-26 21:10:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:31,944 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-26 21:10:31,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:10:31,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:10:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:31,995 INFO L225 Difference]: With dead ends: 43069 [2019-12-26 21:10:31,995 INFO L226 Difference]: Without dead ends: 33469 [2019-12-26 21:10:31,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:10:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-26 21:10:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-26 21:10:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-26 21:10:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-26 21:10:32,397 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-26 21:10:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:32,397 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-26 21:10:32,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:10:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-26 21:10:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:32,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:32,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:32,421 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-26 21:10:32,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:32,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322074914] [2019-12-26 21:10:32,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:32,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322074914] [2019-12-26 21:10:32,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:32,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:10:32,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468710976] [2019-12-26 21:10:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:10:32,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:10:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:10:32,506 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-26 21:10:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:32,987 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-26 21:10:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:10:32,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:10:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:33,050 INFO L225 Difference]: With dead ends: 48601 [2019-12-26 21:10:33,050 INFO L226 Difference]: Without dead ends: 35759 [2019-12-26 21:10:33,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:10:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-26 21:10:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-26 21:10:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-26 21:10:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-26 21:10:33,708 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-26 21:10:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:33,708 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-26 21:10:33,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:10:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-26 21:10:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:33,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:33,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:33,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-26 21:10:33,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:33,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083236851] [2019-12-26 21:10:33,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:33,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083236851] [2019-12-26 21:10:33,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:33,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:10:33,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903404659] [2019-12-26 21:10:33,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:10:33,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:33,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:10:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:10:33,854 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-26 21:10:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:35,111 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-26 21:10:35,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:10:35,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:10:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:35,199 INFO L225 Difference]: With dead ends: 65932 [2019-12-26 21:10:35,199 INFO L226 Difference]: Without dead ends: 63310 [2019-12-26 21:10:35,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:10:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-26 21:10:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-26 21:10:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-26 21:10:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-26 21:10:35,897 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-26 21:10:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:35,897 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-26 21:10:35,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:10:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-26 21:10:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:35,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:35,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:35,920 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-26 21:10:35,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:35,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705603195] [2019-12-26 21:10:35,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705603195] [2019-12-26 21:10:36,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:36,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:10:36,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073157122] [2019-12-26 21:10:36,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:10:36,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:10:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:10:36,042 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-26 21:10:36,285 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-26 21:10:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:37,487 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-26 21:10:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:10:37,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:10:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:37,595 INFO L225 Difference]: With dead ends: 78329 [2019-12-26 21:10:37,595 INFO L226 Difference]: Without dead ends: 75771 [2019-12-26 21:10:37,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:10:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-26 21:10:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-26 21:10:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-26 21:10:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-26 21:10:38,362 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-26 21:10:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:38,363 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-26 21:10:38,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:10:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-26 21:10:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:10:38,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:38,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:38,385 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-26 21:10:38,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:38,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051920575] [2019-12-26 21:10:38,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:38,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051920575] [2019-12-26 21:10:38,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:38,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:38,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504983258] [2019-12-26 21:10:38,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:38,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:38,453 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-26 21:10:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:38,586 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-26 21:10:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:38,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:10:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:38,623 INFO L225 Difference]: With dead ends: 25241 [2019-12-26 21:10:38,624 INFO L226 Difference]: Without dead ends: 25241 [2019-12-26 21:10:38,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-26 21:10:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-26 21:10:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-26 21:10:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-26 21:10:39,230 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-26 21:10:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:39,230 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-26 21:10:39,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-26 21:10:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:39,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:39,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:39,258 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-26 21:10:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:39,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741156411] [2019-12-26 21:10:39,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:39,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741156411] [2019-12-26 21:10:39,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:39,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:10:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112803164] [2019-12-26 21:10:39,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:10:39,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:10:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:10:39,381 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-26 21:10:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:40,261 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-26 21:10:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:10:40,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 21:10:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:40,324 INFO L225 Difference]: With dead ends: 52001 [2019-12-26 21:10:40,324 INFO L226 Difference]: Without dead ends: 48845 [2019-12-26 21:10:40,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:10:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-26 21:10:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-26 21:10:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-26 21:10:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-26 21:10:40,843 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-26 21:10:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:40,844 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-26 21:10:40,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:10:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-26 21:10:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:40,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:40,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:40,869 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-26 21:10:40,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:40,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074590771] [2019-12-26 21:10:40,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:40,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074590771] [2019-12-26 21:10:40,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:40,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:10:40,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189451747] [2019-12-26 21:10:40,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:10:40,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:10:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:10:40,982 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-26 21:10:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:42,505 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-26 21:10:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:10:42,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:10:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:42,640 INFO L225 Difference]: With dead ends: 59225 [2019-12-26 21:10:42,641 INFO L226 Difference]: Without dead ends: 56069 [2019-12-26 21:10:42,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:10:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-26 21:10:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-26 21:10:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-26 21:10:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-26 21:10:43,545 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-26 21:10:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:43,545 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-26 21:10:43,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:10:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-26 21:10:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:43,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:43,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:43,567 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-26 21:10:43,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:43,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128020861] [2019-12-26 21:10:43,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:43,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128020861] [2019-12-26 21:10:43,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:43,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:10:43,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962716049] [2019-12-26 21:10:43,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:10:43,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:10:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:10:43,681 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-26 21:10:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:44,980 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-26 21:10:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:10:44,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:10:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:45,068 INFO L225 Difference]: With dead ends: 65701 [2019-12-26 21:10:45,068 INFO L226 Difference]: Without dead ends: 62568 [2019-12-26 21:10:45,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:10:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-26 21:10:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-26 21:10:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-26 21:10:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-26 21:10:45,706 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-26 21:10:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:45,706 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-26 21:10:45,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:10:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-26 21:10:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:45,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:45,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:45,732 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-26 21:10:45,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:45,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916763789] [2019-12-26 21:10:45,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:45,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916763789] [2019-12-26 21:10:45,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:45,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:10:45,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251817495] [2019-12-26 21:10:45,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:10:45,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:10:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:10:45,892 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-26 21:10:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:46,755 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-26 21:10:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:10:46,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 21:10:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:46,804 INFO L225 Difference]: With dead ends: 33222 [2019-12-26 21:10:46,805 INFO L226 Difference]: Without dead ends: 33222 [2019-12-26 21:10:46,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-26 21:10:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-26 21:10:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-26 21:10:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-26 21:10:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-26 21:10:47,429 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-26 21:10:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:47,430 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-26 21:10:47,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:10:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-26 21:10:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:47,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:47,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:47,455 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-26 21:10:47,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:47,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808313758] [2019-12-26 21:10:47,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:47,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808313758] [2019-12-26 21:10:47,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:47,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:47,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480040739] [2019-12-26 21:10:47,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:10:47,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:10:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:10:47,542 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-26 21:10:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:47,709 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-26 21:10:47,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:10:47,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:10:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:47,757 INFO L225 Difference]: With dead ends: 20191 [2019-12-26 21:10:47,757 INFO L226 Difference]: Without dead ends: 20191 [2019-12-26 21:10:47,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-26 21:10:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-26 21:10:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-26 21:10:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-26 21:10:48,362 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-26 21:10:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:48,362 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-26 21:10:48,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:10:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-26 21:10:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:10:48,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:48,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:48,395 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-26 21:10:48,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:48,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235705530] [2019-12-26 21:10:48,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:48,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235705530] [2019-12-26 21:10:48,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:48,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:48,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406026820] [2019-12-26 21:10:48,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:48,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:48,515 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-26 21:10:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:48,591 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-26 21:10:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:48,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:10:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:48,620 INFO L225 Difference]: With dead ends: 16117 [2019-12-26 21:10:48,620 INFO L226 Difference]: Without dead ends: 16117 [2019-12-26 21:10:48,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-26 21:10:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-26 21:10:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-26 21:10:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-26 21:10:48,872 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-26 21:10:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:48,872 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-26 21:10:48,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-26 21:10:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:10:48,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:48,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:48,888 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-26 21:10:48,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:48,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419569852] [2019-12-26 21:10:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419569852] [2019-12-26 21:10:48,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:48,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:10:48,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841611020] [2019-12-26 21:10:48,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:10:48,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:10:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:10:48,995 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-26 21:10:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:50,341 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-26 21:10:50,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:10:50,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 21:10:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:50,374 INFO L225 Difference]: With dead ends: 28454 [2019-12-26 21:10:50,375 INFO L226 Difference]: Without dead ends: 23657 [2019-12-26 21:10:50,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:10:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-26 21:10:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-26 21:10:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-26 21:10:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-26 21:10:50,899 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-26 21:10:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:50,899 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-26 21:10:50,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:10:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-26 21:10:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:10:50,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:50,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:50,914 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-26 21:10:50,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:50,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787059552] [2019-12-26 21:10:50,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:51,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787059552] [2019-12-26 21:10:51,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:51,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 21:10:51,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654929281] [2019-12-26 21:10:51,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 21:10:51,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 21:10:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:10:51,694 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 22 states. [2019-12-26 21:10:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:57,804 INFO L93 Difference]: Finished difference Result 18630 states and 54513 transitions. [2019-12-26 21:10:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-26 21:10:57,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-26 21:10:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:57,827 INFO L225 Difference]: With dead ends: 18630 [2019-12-26 21:10:57,827 INFO L226 Difference]: Without dead ends: 15411 [2019-12-26 21:10:57,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=571, Invalid=4121, Unknown=0, NotChecked=0, Total=4692 [2019-12-26 21:10:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15411 states. [2019-12-26 21:10:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15411 to 14717. [2019-12-26 21:10:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14717 states. [2019-12-26 21:10:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14717 states to 14717 states and 43621 transitions. [2019-12-26 21:10:58,052 INFO L78 Accepts]: Start accepts. Automaton has 14717 states and 43621 transitions. Word has length 67 [2019-12-26 21:10:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:58,052 INFO L462 AbstractCegarLoop]: Abstraction has 14717 states and 43621 transitions. [2019-12-26 21:10:58,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 21:10:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14717 states and 43621 transitions. [2019-12-26 21:10:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:10:58,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:58,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, 1, 1, 1] [2019-12-26 21:10:58,066 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2010664093, now seen corresponding path program 3 times [2019-12-26 21:10:58,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:58,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939651576] [2019-12-26 21:10:58,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:58,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939651576] [2019-12-26 21:10:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:58,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:10:58,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710417758] [2019-12-26 21:10:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:10:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:10:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:10:58,240 INFO L87 Difference]: Start difference. First operand 14717 states and 43621 transitions. Second operand 11 states. [2019-12-26 21:10:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:59,521 INFO L93 Difference]: Finished difference Result 18926 states and 55591 transitions. [2019-12-26 21:10:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:10:59,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:10:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:59,544 INFO L225 Difference]: With dead ends: 18926 [2019-12-26 21:10:59,545 INFO L226 Difference]: Without dead ends: 17158 [2019-12-26 21:10:59,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:10:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17158 states. [2019-12-26 21:10:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17158 to 14580. [2019-12-26 21:10:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14580 states. [2019-12-26 21:10:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14580 states to 14580 states and 43254 transitions. [2019-12-26 21:10:59,773 INFO L78 Accepts]: Start accepts. Automaton has 14580 states and 43254 transitions. Word has length 67 [2019-12-26 21:10:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:59,773 INFO L462 AbstractCegarLoop]: Abstraction has 14580 states and 43254 transitions. [2019-12-26 21:10:59,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:10:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14580 states and 43254 transitions. [2019-12-26 21:10:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:10:59,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:59,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:59,788 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:10:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 4 times [2019-12-26 21:10:59,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:59,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612835043] [2019-12-26 21:10:59,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:00,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612835043] [2019-12-26 21:11:00,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:00,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 21:11:00,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216880321] [2019-12-26 21:11:00,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 21:11:00,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 21:11:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:11:00,343 INFO L87 Difference]: Start difference. First operand 14580 states and 43254 transitions. Second operand 19 states. [2019-12-26 21:11:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:02,284 INFO L93 Difference]: Finished difference Result 15907 states and 46812 transitions. [2019-12-26 21:11:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:02,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-26 21:11:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:02,305 INFO L225 Difference]: With dead ends: 15907 [2019-12-26 21:11:02,306 INFO L226 Difference]: Without dead ends: 15240 [2019-12-26 21:11:02,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:11:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-12-26 21:11:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 14732. [2019-12-26 21:11:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-12-26 21:11:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 43674 transitions. [2019-12-26 21:11:02,542 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 43674 transitions. Word has length 67 [2019-12-26 21:11:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:02,542 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 43674 transitions. [2019-12-26 21:11:02,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 21:11:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 43674 transitions. [2019-12-26 21:11:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:02,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:02,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:02,559 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:11:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash -299895607, now seen corresponding path program 5 times [2019-12-26 21:11:02,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:02,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375506419] [2019-12-26 21:11:02,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:02,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375506419] [2019-12-26 21:11:02,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:02,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:11:02,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851069575] [2019-12-26 21:11:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:11:02,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:11:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:11:02,745 INFO L87 Difference]: Start difference. First operand 14732 states and 43674 transitions. Second operand 11 states. [2019-12-26 21:11:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:03,823 INFO L93 Difference]: Finished difference Result 30593 states and 89972 transitions. [2019-12-26 21:11:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:11:03,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:11:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:03,853 INFO L225 Difference]: With dead ends: 30593 [2019-12-26 21:11:03,853 INFO L226 Difference]: Without dead ends: 24284 [2019-12-26 21:11:03,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:11:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24284 states. [2019-12-26 21:11:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24284 to 13787. [2019-12-26 21:11:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13787 states. [2019-12-26 21:11:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 40910 transitions. [2019-12-26 21:11:04,371 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 40910 transitions. Word has length 67 [2019-12-26 21:11:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:04,371 INFO L462 AbstractCegarLoop]: Abstraction has 13787 states and 40910 transitions. [2019-12-26 21:11:04,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:11:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 40910 transitions. [2019-12-26 21:11:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:04,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:04,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:04,386 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:11:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 6 times [2019-12-26 21:11:04,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:04,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671078626] [2019-12-26 21:11:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:04,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671078626] [2019-12-26 21:11:04,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:04,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:11:04,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768868451] [2019-12-26 21:11:04,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:11:04,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:04,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:11:04,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:11:04,535 INFO L87 Difference]: Start difference. First operand 13787 states and 40910 transitions. Second operand 11 states. [2019-12-26 21:11:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:05,402 INFO L93 Difference]: Finished difference Result 24250 states and 71473 transitions. [2019-12-26 21:11:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:05,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:11:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:05,434 INFO L225 Difference]: With dead ends: 24250 [2019-12-26 21:11:05,435 INFO L226 Difference]: Without dead ends: 24035 [2019-12-26 21:11:05,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2019-12-26 21:11:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 13611. [2019-12-26 21:11:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2019-12-26 21:11:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 40426 transitions. [2019-12-26 21:11:05,717 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 40426 transitions. Word has length 67 [2019-12-26 21:11:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:05,717 INFO L462 AbstractCegarLoop]: Abstraction has 13611 states and 40426 transitions. [2019-12-26 21:11:05,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:11:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 40426 transitions. [2019-12-26 21:11:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:05,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:05,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:05,732 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:11:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:05,732 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 7 times [2019-12-26 21:11:05,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:05,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339656535] [2019-12-26 21:11:05,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:11:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:11:05,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:11:05,854 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:11:05,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 21:11:05,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= (mod ~a$w_buff1_used~0_Out-1362517174 256) 0) (= P0Thread1of1ForFork2_~arg.offset_Out-1362517174 |P0Thread1of1ForFork2_#in~arg.offset_In-1362517174|) (= ~a$w_buff1~0_Out-1362517174 ~a$w_buff0~0_In-1362517174) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1362517174| 1) (= ~a$w_buff0_used~0_Out-1362517174 1) (= |P0Thread1of1ForFork2_#in~arg.base_In-1362517174| P0Thread1of1ForFork2_~arg.base_Out-1362517174) (= ~a$w_buff1_used~0_Out-1362517174 ~a$w_buff0_used~0_In-1362517174) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1362517174 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1362517174|) (= 1 ~a$w_buff0~0_Out-1362517174)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1362517174|, ~a$w_buff0~0=~a$w_buff0~0_In-1362517174, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362517174, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1362517174|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-1362517174, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1362517174|, ~a$w_buff0~0=~a$w_buff0~0_Out-1362517174, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-1362517174, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1362517174, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1362517174, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1362517174|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1362517174, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-1362517174, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1362517174|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:11:05,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-26 21:11:05,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1967626178 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1967626178 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite10_Out-1967626178| |P1Thread1of1ForFork0_#t~ite9_Out-1967626178|))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1967626178 |P1Thread1of1ForFork0_#t~ite9_Out-1967626178|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~a~0_In-1967626178 |P1Thread1of1ForFork0_#t~ite9_Out-1967626178|) .cse2))) InVars {~a~0=~a~0_In-1967626178, ~a$w_buff1~0=~a$w_buff1~0_In-1967626178, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1967626178, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967626178} OutVars{~a~0=~a~0_In-1967626178, ~a$w_buff1~0=~a$w_buff1~0_In-1967626178, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1967626178|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1967626178, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1967626178|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967626178} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 21:11:05,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1767320886 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1767320886 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out1767320886| ~a$w_buff0_used~0_In1767320886)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out1767320886|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1767320886, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1767320886} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1767320886, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out1767320886|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1767320886} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 21:11:05,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In2127092100 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In2127092100 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In2127092100 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2127092100 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out2127092100|)) (and (= ~a$w_buff1_used~0_In2127092100 |P1Thread1of1ForFork0_#t~ite12_Out2127092100|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2127092100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2127092100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2127092100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2127092100} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2127092100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2127092100, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out2127092100|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2127092100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2127092100} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 21:11:05,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1344914148 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1344914148 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1344914148 |P1Thread1of1ForFork0_#t~ite13_Out-1344914148|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out-1344914148| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1344914148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344914148} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1344914148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1344914148, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1344914148|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 21:11:05,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-818925099 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-818925099 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-818925099 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-818925099 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-818925099| ~a$r_buff1_thd2~0_In-818925099) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-818925099|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-818925099, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-818925099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-818925099, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-818925099} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-818925099, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-818925099, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-818925099, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-818925099|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-818925099} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 21:11:05,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 21:11:05,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-26 21:11:05,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1236109269 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In1236109269| |P2Thread1of1ForFork1_#t~ite20_Out1236109269|) (= |P2Thread1of1ForFork1_#t~ite21_Out1236109269| ~a$w_buff0~0_In1236109269)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1236109269 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1236109269 256))) (and (= 0 (mod ~a$w_buff1_used~0_In1236109269 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1236109269 256)))) (= |P2Thread1of1ForFork1_#t~ite21_Out1236109269| |P2Thread1of1ForFork1_#t~ite20_Out1236109269|) (= ~a$w_buff0~0_In1236109269 |P2Thread1of1ForFork1_#t~ite20_Out1236109269|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1236109269|, ~a$w_buff0~0=~a$w_buff0~0_In1236109269, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1236109269, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1236109269, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1236109269, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1236109269, ~weak$$choice2~0=~weak$$choice2~0_In1236109269} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1236109269|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1236109269|, ~a$w_buff0~0=~a$w_buff0~0_In1236109269, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1236109269, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1236109269, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1236109269, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1236109269, ~weak$$choice2~0=~weak$$choice2~0_In1236109269} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:11:05,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-295284655 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-295284655| |P2Thread1of1ForFork1_#t~ite26_Out-295284655|) (= |P2Thread1of1ForFork1_#t~ite27_Out-295284655| ~a$w_buff0_used~0_In-295284655)) (and (= |P2Thread1of1ForFork1_#t~ite26_Out-295284655| |P2Thread1of1ForFork1_#t~ite27_Out-295284655|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-295284655 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-295284655 256))) (= (mod ~a$w_buff0_used~0_In-295284655 256) 0) (and (= (mod ~a$w_buff1_used~0_In-295284655 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out-295284655| ~a$w_buff0_used~0_In-295284655)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-295284655|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-295284655, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-295284655, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-295284655, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-295284655, ~weak$$choice2~0=~weak$$choice2~0_In-295284655} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-295284655|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-295284655|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-295284655, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-295284655, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-295284655, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-295284655, ~weak$$choice2~0=~weak$$choice2~0_In-295284655} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-26 21:11:05,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:11:05,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:11:05,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-542563213 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-542563213 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-542563213| ~a$w_buff1~0_In-542563213) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-542563213| ~a~0_In-542563213) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-542563213, ~a$w_buff1~0=~a$w_buff1~0_In-542563213, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-542563213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-542563213} OutVars{~a~0=~a~0_In-542563213, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-542563213|, ~a$w_buff1~0=~a$w_buff1~0_In-542563213, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-542563213, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-542563213} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-26 21:11:05,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-26 21:11:05,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In890148 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In890148 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out890148| ~a$w_buff0_used~0_In890148)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out890148| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In890148, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In890148} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In890148, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In890148, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out890148|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 21:11:05,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1011215136 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1011215136 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1011215136 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1011215136 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1011215136|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1011215136 |P2Thread1of1ForFork1_#t~ite41_Out1011215136|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1011215136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1011215136, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1011215136, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1011215136} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1011215136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1011215136, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1011215136, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1011215136|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1011215136} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-26 21:11:05,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1076330230 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1076330230 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1076330230|)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1076330230| ~a$r_buff0_thd3~0_In1076330230) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1076330230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1076330230} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1076330230|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1076330230, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1076330230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-26 21:11:05,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-857213450 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-857213450 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-857213450 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-857213450 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-857213450 |P2Thread1of1ForFork1_#t~ite43_Out-857213450|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out-857213450| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-857213450, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-857213450, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-857213450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-857213450} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-857213450|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-857213450, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-857213450, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-857213450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-857213450} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 21:11:05,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 21:11:05,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In192569378 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In192569378 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out192569378|) (not .cse1)) (and (= ~a$w_buff0_used~0_In192569378 |P0Thread1of1ForFork2_#t~ite5_Out192569378|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In192569378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In192569378} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out192569378|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In192569378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In192569378} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 21:11:05,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1216285347 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1216285347 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1216285347 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1216285347 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite6_Out1216285347| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out1216285347| ~a$w_buff1_used~0_In1216285347) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1216285347, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216285347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1216285347, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1216285347} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1216285347, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1216285347|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216285347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1216285347, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1216285347} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 21:11:05,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-362166101 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-362166101 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-362166101 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-362166101 ~a$r_buff0_thd1~0_In-362166101) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-362166101, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-362166101} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-362166101|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-362166101, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-362166101} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:11:05,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In947035512 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In947035512 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In947035512 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In947035512 256)))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out947035512|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite8_Out947035512| ~a$r_buff1_thd1~0_In947035512) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In947035512, ~a$w_buff0_used~0=~a$w_buff0_used~0_In947035512, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In947035512, ~a$w_buff1_used~0=~a$w_buff1_used~0_In947035512} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out947035512|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In947035512, ~a$w_buff0_used~0=~a$w_buff0_used~0_In947035512, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In947035512, ~a$w_buff1_used~0=~a$w_buff1_used~0_In947035512} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:11:05,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:11:05,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:11:05,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-822068297 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-822068297 256) 0))) (or (and (= ~a$w_buff1~0_In-822068297 |ULTIMATE.start_main_#t~ite47_Out-822068297|) (not .cse0) (not .cse1)) (and (= ~a~0_In-822068297 |ULTIMATE.start_main_#t~ite47_Out-822068297|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-822068297, ~a$w_buff1~0=~a$w_buff1~0_In-822068297, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-822068297, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-822068297} OutVars{~a~0=~a~0_In-822068297, ~a$w_buff1~0=~a$w_buff1~0_In-822068297, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-822068297|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-822068297, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-822068297} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:11:05,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:11:05,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In978242774 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In978242774 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out978242774| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out978242774| ~a$w_buff0_used~0_In978242774)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In978242774, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In978242774} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In978242774, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out978242774|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In978242774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:11:05,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In975171160 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In975171160 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In975171160 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In975171160 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out975171160| ~a$w_buff1_used~0_In975171160)) (and (= |ULTIMATE.start_main_#t~ite50_Out975171160| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In975171160, ~a$w_buff0_used~0=~a$w_buff0_used~0_In975171160, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In975171160, ~a$w_buff1_used~0=~a$w_buff1_used~0_In975171160} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out975171160|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In975171160, ~a$w_buff0_used~0=~a$w_buff0_used~0_In975171160, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In975171160, ~a$w_buff1_used~0=~a$w_buff1_used~0_In975171160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:11:05,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2050853717 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2050853717 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In2050853717 |ULTIMATE.start_main_#t~ite51_Out2050853717|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2050853717| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2050853717, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2050853717} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2050853717|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2050853717, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2050853717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:11:05,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In-1221286460 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1221286460 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1221286460 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1221286460 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1221286460| ~a$r_buff1_thd0~0_In-1221286460) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1221286460|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1221286460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1221286460, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1221286460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1221286460} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1221286460|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1221286460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1221286460, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1221286460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1221286460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:11:05,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:11:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:11:06 BasicIcfg [2019-12-26 21:11:06,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:11:06,013 INFO L168 Benchmark]: Toolchain (without parser) took 113851.55 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 99.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 999.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,014 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.01 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.01 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,015 INFO L168 Benchmark]: Boogie Preprocessor took 56.42 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,016 INFO L168 Benchmark]: RCFGBuilder took 800.75 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 99.5 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,016 INFO L168 Benchmark]: TraceAbstraction took 112113.02 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 935.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:11:06,022 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.51 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.01 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.01 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.42 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.75 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 99.5 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112113.02 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 935.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7714 SDtfs, 11080 SDslu, 29814 SDs, 0 SdLazy, 17169 SolverSat, 528 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2639 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 41.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 352328 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 370286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...