/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:59:21,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:59:21,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:59:21,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:59:21,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:59:21,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:59:21,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:59:21,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:59:21,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:59:21,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:59:21,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:59:21,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:59:21,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:59:21,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:59:21,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:59:21,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:59:21,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:59:21,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:59:21,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:59:21,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:59:21,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:59:21,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:59:21,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:59:21,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:59:21,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:59:21,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:59:21,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:59:21,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:59:21,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:59:21,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:59:21,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:59:21,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:59:21,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:59:21,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:59:21,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:59:21,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:59:21,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:59:21,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:59:21,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:59:21,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:59:21,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:59:21,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:59:21,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:59:21,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:59:21,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:59:21,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:59:21,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:59:21,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:59:21,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:59:21,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:59:21,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:59:21,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:59:21,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:59:21,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:59:21,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:59:21,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:59:21,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:59:21,951 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:59:21,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:59:21,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:59:21,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:59:21,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:59:21,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:59:21,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:59:21,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:59:21,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:59:21,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:59:21,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:59:21,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:59:21,956 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:59:21,956 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:59:21,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:59:21,956 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:59:21,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:59:22,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:59:22,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:59:22,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:59:22,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:59:22,270 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:59:22,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 20:59:22,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76754302/3e0210251427404980d82c1089481735/FLAG3678d624a [2019-12-27 20:59:22,867 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:59:22,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 20:59:22,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76754302/3e0210251427404980d82c1089481735/FLAG3678d624a [2019-12-27 20:59:23,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b76754302/3e0210251427404980d82c1089481735 [2019-12-27 20:59:23,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:59:23,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:59:23,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:59:23,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:59:23,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:59:23,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:23,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11780e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23, skipping insertion in model container [2019-12-27 20:59:23,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:23,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:59:23,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:59:23,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:59:23,794 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:59:23,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:59:23,990 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:59:23,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23 WrapperNode [2019-12-27 20:59:23,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:59:23,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:59:23,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:59:23,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:59:24,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:59:24,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:59:24,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:59:24,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:59:24,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... [2019-12-27 20:59:24,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:59:24,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:59:24,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:59:24,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:59:24,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:59:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:59:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:59:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:59:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:59:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:59:24,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:59:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:59:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:59:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:59:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:59:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:59:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:59:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:59:24,171 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:59:24,920 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:59:24,920 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:59:24,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:24 BoogieIcfgContainer [2019-12-27 20:59:24,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:59:24,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:59:24,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:59:24,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:59:24,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:59:23" (1/3) ... [2019-12-27 20:59:24,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56287d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:24, skipping insertion in model container [2019-12-27 20:59:24,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:23" (2/3) ... [2019-12-27 20:59:24,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56287d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:24, skipping insertion in model container [2019-12-27 20:59:24,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:24" (3/3) ... [2019-12-27 20:59:24,930 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-27 20:59:24,938 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:59:24,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:59:24,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:59:24,949 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:59:24,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:24,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,062 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:25,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:59:25,108 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:59:25,108 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:59:25,108 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:59:25,108 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:59:25,108 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:59:25,109 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:59:25,109 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:59:25,109 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:59:25,133 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 20:59:25,135 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:59:25,262 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:59:25,262 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:59:25,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:59:25,303 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:59:25,356 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:59:25,357 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:59:25,368 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:59:25,390 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:59:25,391 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:59:28,794 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:59:28,936 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:59:29,076 INFO L206 etLargeBlockEncoding]: Checked pairs total: 71962 [2019-12-27 20:59:29,077 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 20:59:29,080 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 96 transitions [2019-12-27 20:59:43,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 101822 states. [2019-12-27 20:59:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 101822 states. [2019-12-27 20:59:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:59:43,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:59:43,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:59:43,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:59:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:59:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 797474839, now seen corresponding path program 1 times [2019-12-27 20:59:43,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:59:43,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710323957] [2019-12-27 20:59:43,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:59:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:59:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:59:43,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710323957] [2019-12-27 20:59:43,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:59:43,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:59:43,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199207257] [2019-12-27 20:59:43,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:59:43,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:59:43,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:59:43,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:59:43,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:59:43,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:59:43,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:59:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:59:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:59:43,724 INFO L87 Difference]: Start difference. First operand 101822 states. Second operand 3 states. [2019-12-27 20:59:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:59:46,452 INFO L93 Difference]: Finished difference Result 99897 states and 434561 transitions. [2019-12-27 20:59:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:59:46,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:59:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:59:47,052 INFO L225 Difference]: With dead ends: 99897 [2019-12-27 20:59:47,052 INFO L226 Difference]: Without dead ends: 94017 [2019-12-27 20:59:47,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:59:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94017 states. [2019-12-27 20:59:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94017 to 94017. [2019-12-27 20:59:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94017 states. [2019-12-27 20:59:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94017 states to 94017 states and 408465 transitions. [2019-12-27 20:59:59,747 INFO L78 Accepts]: Start accepts. Automaton has 94017 states and 408465 transitions. Word has length 5 [2019-12-27 20:59:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:59:59,748 INFO L462 AbstractCegarLoop]: Abstraction has 94017 states and 408465 transitions. [2019-12-27 20:59:59,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:59:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 94017 states and 408465 transitions. [2019-12-27 20:59:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:59:59,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:59:59,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:59:59,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:59:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:59:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1757025115, now seen corresponding path program 1 times [2019-12-27 20:59:59,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:59:59,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526062543] [2019-12-27 20:59:59,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:59:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:59:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:59:59,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526062543] [2019-12-27 20:59:59,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:59:59,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:59:59,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751397764] [2019-12-27 20:59:59,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:59:59,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:59:59,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:59:59,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:59:59,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:59:59,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:59:59,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:59:59,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:59:59,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:59:59,873 INFO L87 Difference]: Start difference. First operand 94017 states and 408465 transitions. Second operand 3 states. [2019-12-27 21:00:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:00,194 INFO L93 Difference]: Finished difference Result 23899 states and 83357 transitions. [2019-12-27 21:00:00,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:00,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:00:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:00,277 INFO L225 Difference]: With dead ends: 23899 [2019-12-27 21:00:00,277 INFO L226 Difference]: Without dead ends: 23899 [2019-12-27 21:00:00,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2019-12-27 21:00:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 23899. [2019-12-27 21:00:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23899 states. [2019-12-27 21:00:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23899 states to 23899 states and 83357 transitions. [2019-12-27 21:00:00,970 INFO L78 Accepts]: Start accepts. Automaton has 23899 states and 83357 transitions. Word has length 13 [2019-12-27 21:00:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:00,970 INFO L462 AbstractCegarLoop]: Abstraction has 23899 states and 83357 transitions. [2019-12-27 21:00:00,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 23899 states and 83357 transitions. [2019-12-27 21:00:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:00:00,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:00,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:00,972 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1772800501, now seen corresponding path program 1 times [2019-12-27 21:00:00,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:00,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290484696] [2019-12-27 21:00:00,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290484696] [2019-12-27 21:00:01,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590177815] [2019-12-27 21:00:01,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:01,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:01,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:00:01,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:01,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:01,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:01,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:01,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:01,081 INFO L87 Difference]: Start difference. First operand 23899 states and 83357 transitions. Second operand 4 states. [2019-12-27 21:00:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:01,527 INFO L93 Difference]: Finished difference Result 35061 states and 117944 transitions. [2019-12-27 21:00:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:01,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:00:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:01,613 INFO L225 Difference]: With dead ends: 35061 [2019-12-27 21:00:01,613 INFO L226 Difference]: Without dead ends: 35047 [2019-12-27 21:00:01,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35047 states. [2019-12-27 21:00:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35047 to 31443. [2019-12-27 21:00:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31443 states. [2019-12-27 21:00:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31443 states to 31443 states and 107008 transitions. [2019-12-27 21:00:03,382 INFO L78 Accepts]: Start accepts. Automaton has 31443 states and 107008 transitions. Word has length 13 [2019-12-27 21:00:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:03,383 INFO L462 AbstractCegarLoop]: Abstraction has 31443 states and 107008 transitions. [2019-12-27 21:00:03,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 31443 states and 107008 transitions. [2019-12-27 21:00:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:00:03,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:03,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:03,386 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1424057850, now seen corresponding path program 1 times [2019-12-27 21:00:03,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:03,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878394693] [2019-12-27 21:00:03,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:03,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878394693] [2019-12-27 21:00:03,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:03,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:03,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615471575] [2019-12-27 21:00:03,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:03,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:03,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:00:03,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:03,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:00:03,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:00:03,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:00:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:03,556 INFO L87 Difference]: Start difference. First operand 31443 states and 107008 transitions. Second operand 7 states. [2019-12-27 21:00:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:04,265 INFO L93 Difference]: Finished difference Result 45557 states and 152262 transitions. [2019-12-27 21:00:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:00:04,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 21:00:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:04,369 INFO L225 Difference]: With dead ends: 45557 [2019-12-27 21:00:04,369 INFO L226 Difference]: Without dead ends: 45539 [2019-12-27 21:00:04,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:00:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45539 states. [2019-12-27 21:00:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45539 to 37201. [2019-12-27 21:00:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37201 states. [2019-12-27 21:00:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37201 states to 37201 states and 125618 transitions. [2019-12-27 21:00:05,794 INFO L78 Accepts]: Start accepts. Automaton has 37201 states and 125618 transitions. Word has length 14 [2019-12-27 21:00:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:05,795 INFO L462 AbstractCegarLoop]: Abstraction has 37201 states and 125618 transitions. [2019-12-27 21:00:05,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:00:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37201 states and 125618 transitions. [2019-12-27 21:00:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:00:05,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:05,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:05,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1169616424, now seen corresponding path program 1 times [2019-12-27 21:00:05,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:05,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791486636] [2019-12-27 21:00:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:05,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791486636] [2019-12-27 21:00:05,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:05,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:00:05,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423079865] [2019-12-27 21:00:05,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:05,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:05,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 21:00:05,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:05,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:05,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:00:05,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:00:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:00:05,956 INFO L87 Difference]: Start difference. First operand 37201 states and 125618 transitions. Second operand 6 states. [2019-12-27 21:00:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:06,934 INFO L93 Difference]: Finished difference Result 55837 states and 184006 transitions. [2019-12-27 21:00:06,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:00:06,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 21:00:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:07,032 INFO L225 Difference]: With dead ends: 55837 [2019-12-27 21:00:07,032 INFO L226 Difference]: Without dead ends: 55807 [2019-12-27 21:00:07,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:00:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55807 states. [2019-12-27 21:00:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55807 to 37101. [2019-12-27 21:00:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37101 states. [2019-12-27 21:00:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37101 states to 37101 states and 124278 transitions. [2019-12-27 21:00:08,239 INFO L78 Accepts]: Start accepts. Automaton has 37101 states and 124278 transitions. Word has length 22 [2019-12-27 21:00:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:08,239 INFO L462 AbstractCegarLoop]: Abstraction has 37101 states and 124278 transitions. [2019-12-27 21:00:08,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:00:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 37101 states and 124278 transitions. [2019-12-27 21:00:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:00:08,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:08,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:08,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 189468664, now seen corresponding path program 1 times [2019-12-27 21:00:08,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:08,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703527616] [2019-12-27 21:00:08,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:08,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703527616] [2019-12-27 21:00:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755214694] [2019-12-27 21:00:08,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:08,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:08,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:00:08,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:08,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:08,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:08,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:08,343 INFO L87 Difference]: Start difference. First operand 37101 states and 124278 transitions. Second operand 4 states. [2019-12-27 21:00:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:08,426 INFO L93 Difference]: Finished difference Result 14221 states and 44268 transitions. [2019-12-27 21:00:08,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:00:08,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:00:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:08,454 INFO L225 Difference]: With dead ends: 14221 [2019-12-27 21:00:08,455 INFO L226 Difference]: Without dead ends: 14221 [2019-12-27 21:00:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2019-12-27 21:00:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 14021. [2019-12-27 21:00:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-12-27 21:00:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 43688 transitions. [2019-12-27 21:00:08,683 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 43688 transitions. Word has length 25 [2019-12-27 21:00:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:08,683 INFO L462 AbstractCegarLoop]: Abstraction has 14021 states and 43688 transitions. [2019-12-27 21:00:08,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 43688 transitions. [2019-12-27 21:00:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:00:08,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:08,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:08,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1050743486, now seen corresponding path program 1 times [2019-12-27 21:00:08,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:08,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285753948] [2019-12-27 21:00:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:08,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-27 21:00:08,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285753948] [2019-12-27 21:00:08,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:08,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:00:08,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321551987] [2019-12-27 21:00:08,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:08,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:08,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 112 transitions. [2019-12-27 21:00:08,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:08,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:00:08,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:00:08,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:00:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:08,989 INFO L87 Difference]: Start difference. First operand 14021 states and 43688 transitions. Second operand 7 states. [2019-12-27 21:00:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:09,646 INFO L93 Difference]: Finished difference Result 19890 states and 61352 transitions. [2019-12-27 21:00:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:00:09,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:00:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:09,674 INFO L225 Difference]: With dead ends: 19890 [2019-12-27 21:00:09,675 INFO L226 Difference]: Without dead ends: 19890 [2019-12-27 21:00:09,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:00:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19890 states. [2019-12-27 21:00:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19890 to 18261. [2019-12-27 21:00:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18261 states. [2019-12-27 21:00:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18261 states to 18261 states and 56751 transitions. [2019-12-27 21:00:09,964 INFO L78 Accepts]: Start accepts. Automaton has 18261 states and 56751 transitions. Word has length 39 [2019-12-27 21:00:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:09,964 INFO L462 AbstractCegarLoop]: Abstraction has 18261 states and 56751 transitions. [2019-12-27 21:00:09,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:00:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 18261 states and 56751 transitions. [2019-12-27 21:00:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:00:09,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:09,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:09,990 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash -92841788, now seen corresponding path program 2 times [2019-12-27 21:00:09,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:09,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710808983] [2019-12-27 21:00:09,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:10,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710808983] [2019-12-27 21:00:10,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:10,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:10,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137795718] [2019-12-27 21:00:10,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:10,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:10,296 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 114 transitions. [2019-12-27 21:00:10,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:10,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:00:10,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:00:10,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:00:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:00:10,381 INFO L87 Difference]: Start difference. First operand 18261 states and 56751 transitions. Second operand 9 states. [2019-12-27 21:00:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:12,369 INFO L93 Difference]: Finished difference Result 52445 states and 161077 transitions. [2019-12-27 21:00:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:00:12,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-27 21:00:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:12,452 INFO L225 Difference]: With dead ends: 52445 [2019-12-27 21:00:12,452 INFO L226 Difference]: Without dead ends: 52445 [2019-12-27 21:00:12,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:00:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52445 states. [2019-12-27 21:00:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52445 to 20512. [2019-12-27 21:00:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20512 states. [2019-12-27 21:00:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20512 states to 20512 states and 64048 transitions. [2019-12-27 21:00:12,989 INFO L78 Accepts]: Start accepts. Automaton has 20512 states and 64048 transitions. Word has length 39 [2019-12-27 21:00:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:12,990 INFO L462 AbstractCegarLoop]: Abstraction has 20512 states and 64048 transitions. [2019-12-27 21:00:12,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:00:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20512 states and 64048 transitions. [2019-12-27 21:00:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:00:13,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:13,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:13,023 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1162424668, now seen corresponding path program 3 times [2019-12-27 21:00:13,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:13,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904371424] [2019-12-27 21:00:13,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:13,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904371424] [2019-12-27 21:00:13,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:13,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:00:13,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389908244] [2019-12-27 21:00:13,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:13,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:13,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 105 transitions. [2019-12-27 21:00:13,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:13,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:13,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:13,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:13,117 INFO L87 Difference]: Start difference. First operand 20512 states and 64048 transitions. Second operand 5 states. [2019-12-27 21:00:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:13,206 INFO L93 Difference]: Finished difference Result 19016 states and 60170 transitions. [2019-12-27 21:00:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:13,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 21:00:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:13,235 INFO L225 Difference]: With dead ends: 19016 [2019-12-27 21:00:13,236 INFO L226 Difference]: Without dead ends: 19016 [2019-12-27 21:00:13,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19016 states. [2019-12-27 21:00:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19016 to 18230. [2019-12-27 21:00:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-27 21:00:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 57960 transitions. [2019-12-27 21:00:13,733 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 57960 transitions. Word has length 39 [2019-12-27 21:00:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:13,734 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 57960 transitions. [2019-12-27 21:00:13,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 57960 transitions. [2019-12-27 21:00:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:13,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:13,759 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] [2019-12-27 21:00:13,759 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:13,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1617433659, now seen corresponding path program 1 times [2019-12-27 21:00:13,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:13,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250650413] [2019-12-27 21:00:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:13,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250650413] [2019-12-27 21:00:13,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:13,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:13,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704703365] [2019-12-27 21:00:13,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:13,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:13,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 262 transitions. [2019-12-27 21:00:13,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:13,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:00:13,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:13,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:13,953 INFO L87 Difference]: Start difference. First operand 18230 states and 57960 transitions. Second operand 3 states. [2019-12-27 21:00:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:14,070 INFO L93 Difference]: Finished difference Result 24383 states and 75961 transitions. [2019-12-27 21:00:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:14,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 21:00:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:14,105 INFO L225 Difference]: With dead ends: 24383 [2019-12-27 21:00:14,105 INFO L226 Difference]: Without dead ends: 24383 [2019-12-27 21:00:14,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-27 21:00:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 19417. [2019-12-27 21:00:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19417 states. [2019-12-27 21:00:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19417 states to 19417 states and 61401 transitions. [2019-12-27 21:00:14,427 INFO L78 Accepts]: Start accepts. Automaton has 19417 states and 61401 transitions. Word has length 54 [2019-12-27 21:00:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:14,428 INFO L462 AbstractCegarLoop]: Abstraction has 19417 states and 61401 transitions. [2019-12-27 21:00:14,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 19417 states and 61401 transitions. [2019-12-27 21:00:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:14,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:14,452 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] [2019-12-27 21:00:14,453 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -832875013, now seen corresponding path program 1 times [2019-12-27 21:00:14,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:14,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559222528] [2019-12-27 21:00:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:14,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559222528] [2019-12-27 21:00:14,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:14,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:14,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113063432] [2019-12-27 21:00:14,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:14,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:14,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 262 transitions. [2019-12-27 21:00:14,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:14,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:00:14,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:14,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:14,690 INFO L87 Difference]: Start difference. First operand 19417 states and 61401 transitions. Second operand 5 states. [2019-12-27 21:00:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:15,155 INFO L93 Difference]: Finished difference Result 42292 states and 133120 transitions. [2019-12-27 21:00:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:00:15,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 21:00:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:15,206 INFO L225 Difference]: With dead ends: 42292 [2019-12-27 21:00:15,206 INFO L226 Difference]: Without dead ends: 22763 [2019-12-27 21:00:15,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22763 states. [2019-12-27 21:00:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22763 to 16199. [2019-12-27 21:00:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16199 states. [2019-12-27 21:00:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16199 states to 16199 states and 51163 transitions. [2019-12-27 21:00:15,765 INFO L78 Accepts]: Start accepts. Automaton has 16199 states and 51163 transitions. Word has length 54 [2019-12-27 21:00:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:15,766 INFO L462 AbstractCegarLoop]: Abstraction has 16199 states and 51163 transitions. [2019-12-27 21:00:15,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16199 states and 51163 transitions. [2019-12-27 21:00:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:15,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:15,794 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] [2019-12-27 21:00:15,794 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:15,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1073450609, now seen corresponding path program 2 times [2019-12-27 21:00:15,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:15,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765556753] [2019-12-27 21:00:15,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765556753] [2019-12-27 21:00:15,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:15,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:15,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446272471] [2019-12-27 21:00:15,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:15,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:16,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 268 transitions. [2019-12-27 21:00:16,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:16,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:00:16,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:00:16,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:16,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:00:16,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:00:16,094 INFO L87 Difference]: Start difference. First operand 16199 states and 51163 transitions. Second operand 9 states. [2019-12-27 21:00:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:17,596 INFO L93 Difference]: Finished difference Result 60335 states and 185970 transitions. [2019-12-27 21:00:17,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:00:17,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 21:00:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:17,665 INFO L225 Difference]: With dead ends: 60335 [2019-12-27 21:00:17,665 INFO L226 Difference]: Without dead ends: 45474 [2019-12-27 21:00:17,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:00:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45474 states. [2019-12-27 21:00:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45474 to 19656. [2019-12-27 21:00:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19656 states. [2019-12-27 21:00:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19656 states to 19656 states and 62037 transitions. [2019-12-27 21:00:18,182 INFO L78 Accepts]: Start accepts. Automaton has 19656 states and 62037 transitions. Word has length 54 [2019-12-27 21:00:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:18,182 INFO L462 AbstractCegarLoop]: Abstraction has 19656 states and 62037 transitions. [2019-12-27 21:00:18,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:00:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19656 states and 62037 transitions. [2019-12-27 21:00:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:18,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:18,211 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] [2019-12-27 21:00:18,211 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -345609331, now seen corresponding path program 3 times [2019-12-27 21:00:18,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:18,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760205118] [2019-12-27 21:00:18,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:18,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760205118] [2019-12-27 21:00:18,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:18,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:18,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035123541] [2019-12-27 21:00:18,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:18,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:18,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 412 transitions. [2019-12-27 21:00:18,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:18,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:00:18,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:00:18,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:00:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:00:18,772 INFO L87 Difference]: Start difference. First operand 19656 states and 62037 transitions. Second operand 10 states. [2019-12-27 21:00:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:19,310 INFO L93 Difference]: Finished difference Result 48358 states and 149080 transitions. [2019-12-27 21:00:19,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:00:19,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 21:00:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:19,391 INFO L225 Difference]: With dead ends: 48358 [2019-12-27 21:00:19,392 INFO L226 Difference]: Without dead ends: 34492 [2019-12-27 21:00:19,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:00:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34492 states. [2019-12-27 21:00:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34492 to 22964. [2019-12-27 21:00:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22964 states. [2019-12-27 21:00:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22964 states to 22964 states and 72112 transitions. [2019-12-27 21:00:19,912 INFO L78 Accepts]: Start accepts. Automaton has 22964 states and 72112 transitions. Word has length 54 [2019-12-27 21:00:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:19,912 INFO L462 AbstractCegarLoop]: Abstraction has 22964 states and 72112 transitions. [2019-12-27 21:00:19,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:00:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22964 states and 72112 transitions. [2019-12-27 21:00:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:19,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:19,941 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] [2019-12-27 21:00:19,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash -682045085, now seen corresponding path program 4 times [2019-12-27 21:00:19,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:19,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617107034] [2019-12-27 21:00:19,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:20,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617107034] [2019-12-27 21:00:20,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:20,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808472782] [2019-12-27 21:00:20,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:20,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:20,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 251 transitions. [2019-12-27 21:00:20,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:20,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:00:20,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:00:20,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:20,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:00:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:00:20,309 INFO L87 Difference]: Start difference. First operand 22964 states and 72112 transitions. Second operand 10 states. [2019-12-27 21:00:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:22,890 INFO L93 Difference]: Finished difference Result 87998 states and 271165 transitions. [2019-12-27 21:00:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 21:00:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 21:00:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:23,009 INFO L225 Difference]: With dead ends: 87998 [2019-12-27 21:00:23,010 INFO L226 Difference]: Without dead ends: 70250 [2019-12-27 21:00:23,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 21:00:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70250 states. [2019-12-27 21:00:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70250 to 26229. [2019-12-27 21:00:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26229 states. [2019-12-27 21:00:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 82971 transitions. [2019-12-27 21:00:23,785 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 82971 transitions. Word has length 54 [2019-12-27 21:00:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:23,785 INFO L462 AbstractCegarLoop]: Abstraction has 26229 states and 82971 transitions. [2019-12-27 21:00:23,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:00:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 82971 transitions. [2019-12-27 21:00:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:23,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:23,817 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] [2019-12-27 21:00:23,818 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash -997212989, now seen corresponding path program 1 times [2019-12-27 21:00:23,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651116661] [2019-12-27 21:00:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:23,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651116661] [2019-12-27 21:00:23,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:23,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:23,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071486117] [2019-12-27 21:00:23,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:23,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:24,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 251 transitions. [2019-12-27 21:00:24,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:24,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:00:24,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:24,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:24,045 INFO L87 Difference]: Start difference. First operand 26229 states and 82971 transitions. Second operand 3 states. [2019-12-27 21:00:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:24,190 INFO L93 Difference]: Finished difference Result 27529 states and 84006 transitions. [2019-12-27 21:00:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:24,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 21:00:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:24,228 INFO L225 Difference]: With dead ends: 27529 [2019-12-27 21:00:24,228 INFO L226 Difference]: Without dead ends: 27529 [2019-12-27 21:00:24,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27529 states. [2019-12-27 21:00:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27529 to 25981. [2019-12-27 21:00:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25981 states. [2019-12-27 21:00:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25981 states to 25981 states and 79468 transitions. [2019-12-27 21:00:24,880 INFO L78 Accepts]: Start accepts. Automaton has 25981 states and 79468 transitions. Word has length 54 [2019-12-27 21:00:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:24,880 INFO L462 AbstractCegarLoop]: Abstraction has 25981 states and 79468 transitions. [2019-12-27 21:00:24,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25981 states and 79468 transitions. [2019-12-27 21:00:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:00:24,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:24,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:24,912 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -693885685, now seen corresponding path program 5 times [2019-12-27 21:00:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:24,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565494165] [2019-12-27 21:00:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:24,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565494165] [2019-12-27 21:00:24,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:24,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:24,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427673887] [2019-12-27 21:00:24,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:24,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:25,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 498 transitions. [2019-12-27 21:00:25,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:25,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:00:25,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:25,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:25,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:25,236 INFO L87 Difference]: Start difference. First operand 25981 states and 79468 transitions. Second operand 4 states. [2019-12-27 21:00:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:25,503 INFO L93 Difference]: Finished difference Result 25535 states and 76117 transitions. [2019-12-27 21:00:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:25,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 21:00:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:25,559 INFO L225 Difference]: With dead ends: 25535 [2019-12-27 21:00:25,559 INFO L226 Difference]: Without dead ends: 25535 [2019-12-27 21:00:25,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25535 states. [2019-12-27 21:00:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25535 to 19112. [2019-12-27 21:00:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19112 states. [2019-12-27 21:00:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19112 states to 19112 states and 57566 transitions. [2019-12-27 21:00:26,109 INFO L78 Accepts]: Start accepts. Automaton has 19112 states and 57566 transitions. Word has length 54 [2019-12-27 21:00:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:26,110 INFO L462 AbstractCegarLoop]: Abstraction has 19112 states and 57566 transitions. [2019-12-27 21:00:26,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19112 states and 57566 transitions. [2019-12-27 21:00:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:00:26,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:26,140 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] [2019-12-27 21:00:26,141 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 673645833, now seen corresponding path program 1 times [2019-12-27 21:00:26,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:26,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542537387] [2019-12-27 21:00:26,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:26,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542537387] [2019-12-27 21:00:26,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:26,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:00:26,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691905743] [2019-12-27 21:00:26,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:26,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:26,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 257 transitions. [2019-12-27 21:00:26,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:26,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:00:26,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:00:26,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:00:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:00:26,551 INFO L87 Difference]: Start difference. First operand 19112 states and 57566 transitions. Second operand 12 states. [2019-12-27 21:00:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:28,802 INFO L93 Difference]: Finished difference Result 34058 states and 101693 transitions. [2019-12-27 21:00:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:00:28,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 21:00:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:28,841 INFO L225 Difference]: With dead ends: 34058 [2019-12-27 21:00:28,841 INFO L226 Difference]: Without dead ends: 27255 [2019-12-27 21:00:28,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:00:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27255 states. [2019-12-27 21:00:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27255 to 19648. [2019-12-27 21:00:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19648 states. [2019-12-27 21:00:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19648 states to 19648 states and 58745 transitions. [2019-12-27 21:00:29,172 INFO L78 Accepts]: Start accepts. Automaton has 19648 states and 58745 transitions. Word has length 55 [2019-12-27 21:00:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:29,172 INFO L462 AbstractCegarLoop]: Abstraction has 19648 states and 58745 transitions. [2019-12-27 21:00:29,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:00:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19648 states and 58745 transitions. [2019-12-27 21:00:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:00:29,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:29,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:29,191 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash 483812939, now seen corresponding path program 2 times [2019-12-27 21:00:29,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:29,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572703258] [2019-12-27 21:00:29,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:29,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572703258] [2019-12-27 21:00:29,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:29,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:00:29,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853566345] [2019-12-27 21:00:29,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:29,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:29,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 230 transitions. [2019-12-27 21:00:29,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:29,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:00:29,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:00:29,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:00:29,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:29,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:00:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:00:29,670 INFO L87 Difference]: Start difference. First operand 19648 states and 58745 transitions. Second operand 14 states. [2019-12-27 21:00:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:34,429 INFO L93 Difference]: Finished difference Result 44234 states and 128668 transitions. [2019-12-27 21:00:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 21:00:34,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-27 21:00:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:34,486 INFO L225 Difference]: With dead ends: 44234 [2019-12-27 21:00:34,486 INFO L226 Difference]: Without dead ends: 44030 [2019-12-27 21:00:34,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 21:00:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44030 states. [2019-12-27 21:00:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44030 to 21650. [2019-12-27 21:00:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21650 states. [2019-12-27 21:00:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21650 states to 21650 states and 64698 transitions. [2019-12-27 21:00:34,941 INFO L78 Accepts]: Start accepts. Automaton has 21650 states and 64698 transitions. Word has length 55 [2019-12-27 21:00:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:34,942 INFO L462 AbstractCegarLoop]: Abstraction has 21650 states and 64698 transitions. [2019-12-27 21:00:34,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:00:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21650 states and 64698 transitions. [2019-12-27 21:00:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:00:34,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:34,963 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] [2019-12-27 21:00:34,963 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1194468433, now seen corresponding path program 3 times [2019-12-27 21:00:34,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:34,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496758397] [2019-12-27 21:00:34,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:35,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496758397] [2019-12-27 21:00:35,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:35,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:00:35,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613711373] [2019-12-27 21:00:35,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:35,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:35,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 434 transitions. [2019-12-27 21:00:35,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:35,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:00:35,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:00:35,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:00:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:00:35,577 INFO L87 Difference]: Start difference. First operand 21650 states and 64698 transitions. Second operand 15 states. [2019-12-27 21:00:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:37,279 INFO L93 Difference]: Finished difference Result 27987 states and 83143 transitions. [2019-12-27 21:00:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:00:37,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 21:00:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:37,317 INFO L225 Difference]: With dead ends: 27987 [2019-12-27 21:00:37,318 INFO L226 Difference]: Without dead ends: 26427 [2019-12-27 21:00:37,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:00:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26427 states. [2019-12-27 21:00:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26427 to 21737. [2019-12-27 21:00:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21737 states. [2019-12-27 21:00:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21737 states to 21737 states and 64896 transitions. [2019-12-27 21:00:37,682 INFO L78 Accepts]: Start accepts. Automaton has 21737 states and 64896 transitions. Word has length 55 [2019-12-27 21:00:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:37,682 INFO L462 AbstractCegarLoop]: Abstraction has 21737 states and 64896 transitions. [2019-12-27 21:00:37,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:00:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21737 states and 64896 transitions. [2019-12-27 21:00:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:00:37,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:37,706 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] [2019-12-27 21:00:37,707 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -259700577, now seen corresponding path program 4 times [2019-12-27 21:00:37,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:37,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160821241] [2019-12-27 21:00:37,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:38,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160821241] [2019-12-27 21:00:38,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:38,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:00:38,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713331218] [2019-12-27 21:00:38,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:38,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:38,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 260 transitions. [2019-12-27 21:00:38,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:38,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 21:00:38,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:00:38,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:00:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:00:38,541 INFO L87 Difference]: Start difference. First operand 21737 states and 64896 transitions. Second operand 19 states. [2019-12-27 21:00:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:42,448 INFO L93 Difference]: Finished difference Result 52602 states and 155773 transitions. [2019-12-27 21:00:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 21:00:42,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-27 21:00:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:42,522 INFO L225 Difference]: With dead ends: 52602 [2019-12-27 21:00:42,523 INFO L226 Difference]: Without dead ends: 51464 [2019-12-27 21:00:42,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=894, Invalid=4958, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 21:00:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-12-27 21:00:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 25130. [2019-12-27 21:00:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25130 states. [2019-12-27 21:00:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25130 states to 25130 states and 74196 transitions. [2019-12-27 21:00:43,066 INFO L78 Accepts]: Start accepts. Automaton has 25130 states and 74196 transitions. Word has length 55 [2019-12-27 21:00:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:43,066 INFO L462 AbstractCegarLoop]: Abstraction has 25130 states and 74196 transitions. [2019-12-27 21:00:43,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:00:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25130 states and 74196 transitions. [2019-12-27 21:00:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:00:43,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:43,092 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] [2019-12-27 21:00:43,092 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -171833141, now seen corresponding path program 5 times [2019-12-27 21:00:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:43,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145857169] [2019-12-27 21:00:43,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:43,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145857169] [2019-12-27 21:00:43,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:43,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:43,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054005044] [2019-12-27 21:00:43,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:43,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:43,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 299 transitions. [2019-12-27 21:00:43,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:43,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:43,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:43,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:43,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:43,521 INFO L87 Difference]: Start difference. First operand 25130 states and 74196 transitions. Second operand 3 states. [2019-12-27 21:00:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:43,633 INFO L93 Difference]: Finished difference Result 25128 states and 74191 transitions. [2019-12-27 21:00:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:43,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:00:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:43,671 INFO L225 Difference]: With dead ends: 25128 [2019-12-27 21:00:43,671 INFO L226 Difference]: Without dead ends: 25128 [2019-12-27 21:00:43,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25128 states. [2019-12-27 21:00:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25128 to 20954. [2019-12-27 21:00:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2019-12-27 21:00:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 62924 transitions. [2019-12-27 21:00:44,017 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 62924 transitions. Word has length 55 [2019-12-27 21:00:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:44,017 INFO L462 AbstractCegarLoop]: Abstraction has 20954 states and 62924 transitions. [2019-12-27 21:00:44,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 62924 transitions. [2019-12-27 21:00:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:00:44,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:44,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:44,040 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1213693398, now seen corresponding path program 1 times [2019-12-27 21:00:44,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:44,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670153355] [2019-12-27 21:00:44,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:44,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670153355] [2019-12-27 21:00:44,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:44,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:00:44,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113220169] [2019-12-27 21:00:44,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:44,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:44,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 360 transitions. [2019-12-27 21:00:44,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:44,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 21:00:44,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:00:44,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:44,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:00:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:00:44,856 INFO L87 Difference]: Start difference. First operand 20954 states and 62924 transitions. Second operand 17 states. [2019-12-27 21:00:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:47,939 INFO L93 Difference]: Finished difference Result 37641 states and 111846 transitions. [2019-12-27 21:00:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 21:00:47,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 21:00:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:47,982 INFO L225 Difference]: With dead ends: 37641 [2019-12-27 21:00:47,982 INFO L226 Difference]: Without dead ends: 31745 [2019-12-27 21:00:47,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=330, Invalid=1476, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 21:00:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31745 states. [2019-12-27 21:00:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31745 to 17471. [2019-12-27 21:00:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17471 states. [2019-12-27 21:00:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17471 states to 17471 states and 53064 transitions. [2019-12-27 21:00:48,561 INFO L78 Accepts]: Start accepts. Automaton has 17471 states and 53064 transitions. Word has length 56 [2019-12-27 21:00:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:48,561 INFO L462 AbstractCegarLoop]: Abstraction has 17471 states and 53064 transitions. [2019-12-27 21:00:48,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:00:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17471 states and 53064 transitions. [2019-12-27 21:00:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:00:48,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:48,578 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] [2019-12-27 21:00:48,578 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1135634574, now seen corresponding path program 2 times [2019-12-27 21:00:48,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:48,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960817117] [2019-12-27 21:00:48,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:00:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:00:48,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:00:48,678 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:00:48,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~a~0_9) (= v_~x$r_buff1_thd2~0_17 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= v_~x$w_buff1_used~0_63 0) (= v_~x$r_buff1_thd0~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~x~0_24 0) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~z~0_7) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$mem_tmp~0_10 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= 0 v_~x$w_buff0_used~0_109) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_31) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~a~0=v_~a~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_24, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_17, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:00:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-27 21:00:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 21:00:48,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 v_~x$w_buff0~0_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 21:00:48,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1843055166 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1843055166 256) 0))) (or (and (= ~x~0_In-1843055166 |P2Thread1of1ForFork2_#t~ite32_Out-1843055166|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out-1843055166| ~x$w_buff1~0_In-1843055166) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1843055166, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1843055166, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1843055166, ~x~0=~x~0_In-1843055166} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-1843055166|, ~x$w_buff1~0=~x$w_buff1~0_In-1843055166, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1843055166, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1843055166, ~x~0=~x~0_In-1843055166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 21:00:48,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-226282803 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-226282803 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-226282803| ~x$w_buff0_used~0_In-226282803)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-226282803| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226282803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226282803} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226282803, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-226282803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226282803} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:00:48,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= |v_P2Thread1of1ForFork2_#t~ite32_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-27 21:00:48,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1046630546 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1046630546 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out1046630546| 0)) (and (= ~x$w_buff0_used~0_In1046630546 |P2Thread1of1ForFork2_#t~ite34_Out1046630546|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1046630546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1046630546} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1046630546|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1046630546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1046630546} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 21:00:48,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In6082628 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In6082628 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In6082628 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In6082628 256)))) (or (and (= ~x$w_buff1_used~0_In6082628 |P2Thread1of1ForFork2_#t~ite35_Out6082628|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out6082628|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In6082628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In6082628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In6082628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6082628} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out6082628|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In6082628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In6082628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In6082628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6082628} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 21:00:48,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1191862874 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1191862874 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1191862874 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1191862874 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-1191862874| ~x$w_buff1_used~0_In-1191862874)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1191862874|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191862874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1191862874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1191862874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191862874} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1191862874|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191862874, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1191862874, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1191862874, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191862874} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 21:00:48,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1513895304 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1513895304 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-1513895304 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1513895304 ~x$r_buff0_thd2~0_In-1513895304)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1513895304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1513895304} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1513895304|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1513895304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1513895304} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:00:48,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1724961801 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1724961801 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1724961801 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1724961801 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1724961801 |P1Thread1of1ForFork1_#t~ite31_Out-1724961801|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1724961801| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724961801, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1724961801, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1724961801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724961801} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1724961801|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724961801, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1724961801, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1724961801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724961801} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:00:48,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:00:48,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1582082686 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out-1582082686| |P0Thread1of1ForFork0_#t~ite12_Out-1582082686|) (= |P0Thread1of1ForFork0_#t~ite11_Out-1582082686| ~x$w_buff1~0_In-1582082686) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1582082686 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1582082686 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1582082686 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1582082686 256)))))) (and (not .cse0) (= ~x$w_buff1~0_In-1582082686 |P0Thread1of1ForFork0_#t~ite12_Out-1582082686|) (= |P0Thread1of1ForFork0_#t~ite11_In-1582082686| |P0Thread1of1ForFork0_#t~ite11_Out-1582082686|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1582082686|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1582082686, ~x$w_buff1~0=~x$w_buff1~0_In-1582082686, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1582082686, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1582082686, ~weak$$choice2~0=~weak$$choice2~0_In-1582082686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1582082686} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1582082686|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1582082686, ~x$w_buff1~0=~x$w_buff1~0_In-1582082686, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1582082686, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1582082686, ~weak$$choice2~0=~weak$$choice2~0_In-1582082686, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1582082686|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1582082686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:00:48,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1090105969 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In1090105969 |P0Thread1of1ForFork0_#t~ite15_Out1090105969|) (= |P0Thread1of1ForFork0_#t~ite14_In1090105969| |P0Thread1of1ForFork0_#t~ite14_Out1090105969|)) (and (= ~x$w_buff0_used~0_In1090105969 |P0Thread1of1ForFork0_#t~ite14_Out1090105969|) (= |P0Thread1of1ForFork0_#t~ite14_Out1090105969| |P0Thread1of1ForFork0_#t~ite15_Out1090105969|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1090105969 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1090105969 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1090105969 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1090105969 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1090105969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1090105969, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1090105969, ~weak$$choice2~0=~weak$$choice2~0_In1090105969, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In1090105969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1090105969} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1090105969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1090105969, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1090105969, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out1090105969|, ~weak$$choice2~0=~weak$$choice2~0_In1090105969, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1090105969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1090105969} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:00:48,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_45 v_~x$r_buff0_thd1~0_44) (not (= (mod v_~weak$$choice2~0_19 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 21:00:48,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~x$mem_tmp~0_5 v_~x~0_19) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 21:00:48,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-590436795 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-590436795 256)))) (or (and (= ~x$r_buff0_thd3~0_In-590436795 |P2Thread1of1ForFork2_#t~ite36_Out-590436795|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-590436795|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590436795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590436795} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-590436795|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590436795, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590436795} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 21:00:48,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1445956468 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1445956468 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1445956468 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1445956468 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite37_Out-1445956468| ~x$r_buff1_thd3~0_In-1445956468)) (and (= |P2Thread1of1ForFork2_#t~ite37_Out-1445956468| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1445956468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1445956468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1445956468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1445956468} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1445956468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1445956468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1445956468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1445956468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1445956468} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 21:00:48,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~x$r_buff1_thd3~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 21:00:48,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:00:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1739302577 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1739302577 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1739302577| ~x~0_In1739302577) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1739302577 |ULTIMATE.start_main_#t~ite41_Out1739302577|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1739302577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1739302577, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1739302577, ~x~0=~x~0_In1739302577} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1739302577|, ~x$w_buff1~0=~x$w_buff1~0_In1739302577, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1739302577, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1739302577, ~x~0=~x~0_In1739302577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:00:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 21:00:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1178024680 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1178024680 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1178024680| ~x$w_buff0_used~0_In1178024680)) (and (= |ULTIMATE.start_main_#t~ite43_Out1178024680| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1178024680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1178024680} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1178024680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1178024680|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1178024680} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:00:48,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-66047698 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-66047698 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-66047698 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-66047698 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-66047698| ~x$w_buff1_used~0_In-66047698)) (and (= |ULTIMATE.start_main_#t~ite44_Out-66047698| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-66047698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-66047698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-66047698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-66047698} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-66047698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-66047698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-66047698, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-66047698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-66047698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:00:48,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-687252382 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-687252382 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-687252382| ~x$r_buff0_thd0~0_In-687252382) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-687252382| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-687252382, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-687252382} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-687252382, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-687252382|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-687252382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:00:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-450293937 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-450293937 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-450293937 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-450293937 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-450293937 |ULTIMATE.start_main_#t~ite46_Out-450293937|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-450293937|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-450293937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-450293937, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-450293937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-450293937} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-450293937, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-450293937|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-450293937, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-450293937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-450293937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 21:00:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_15 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_8 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:00:48,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:00:48 BasicIcfg [2019-12-27 21:00:48,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:00:48,780 INFO L168 Benchmark]: Toolchain (without parser) took 85603.30 ms. Allocated memory was 135.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,781 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.15 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 153.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.64 ms. Allocated memory is still 199.8 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,786 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,786 INFO L168 Benchmark]: RCFGBuilder took 823.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 101.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,787 INFO L168 Benchmark]: TraceAbstraction took 83852.81 ms. Allocated memory was 199.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 21:00:48,793 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.15 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 153.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.64 ms. Allocated memory is still 199.8 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.26 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.34 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 101.1 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83852.81 ms. Allocated memory was 199.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 166 ProgramPointsBefore, 86 ProgramPointsAfterwards, 197 TransitionsBefore, 96 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 6251 VarBasedMoverChecksPositive, 206 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 71962 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t928, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t929, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t930, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.5s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5140 SDtfs, 9078 SDslu, 20610 SDs, 0 SdLazy, 16261 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 118 SyntacticMatches, 56 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3231 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 245523 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 974 NumberOfCodeBlocks, 974 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 145534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...