/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:38:51,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:38:51,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:38:51,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:38:51,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:38:51,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:38:51,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:38:51,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:38:51,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:38:51,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:38:51,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:38:51,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:38:51,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:38:51,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:38:51,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:38:51,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:38:51,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:38:51,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:38:51,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:38:51,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:38:51,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:38:51,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:38:51,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:38:51,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:38:51,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:38:51,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:38:51,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:38:51,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:38:51,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:38:51,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:38:51,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:38:51,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:38:51,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:38:51,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:38:51,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:38:51,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:38:51,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:38:51,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:38:51,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:38:51,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:38:51,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:38:51,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:38:51,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:38:51,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:38:51,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:38:51,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:38:51,931 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:38:51,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:38:51,931 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:38:51,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:38:51,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:38:51,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:38:51,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:38:51,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:38:51,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:38:51,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:38:51,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:38:51,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:38:51,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:38:51,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:38:51,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:38:51,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:38:51,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:38:51,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:38:51,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:38:51,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:38:51,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:38:51,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:38:51,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:38:51,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:38:51,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:38:51,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:38:52,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:38:52,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:38:52,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:38:52,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:38:52,268 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:38:52,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-26 23:38:52,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4de37fd7/a3d7413531194c3ab36f7b2ad719d9b8/FLAG218fb8a0f [2019-12-26 23:38:52,873 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:38:52,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_rmo.opt.i [2019-12-26 23:38:52,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4de37fd7/a3d7413531194c3ab36f7b2ad719d9b8/FLAG218fb8a0f [2019-12-26 23:38:53,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4de37fd7/a3d7413531194c3ab36f7b2ad719d9b8 [2019-12-26 23:38:53,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:38:53,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:38:53,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:38:53,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:38:53,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:38:53,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:38:53" (1/1) ... [2019-12-26 23:38:53,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e04a7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:53, skipping insertion in model container [2019-12-26 23:38:53,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:38:53" (1/1) ... [2019-12-26 23:38:53,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:38:53,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:38:53,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:38:53,899 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:38:53,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:38:54,042 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:38:54,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54 WrapperNode [2019-12-26 23:38:54,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:38:54,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:38:54,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:38:54,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:38:54,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:38:54,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:38:54,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:38:54,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:38:54,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... [2019-12-26 23:38:54,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:38:54,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:38:54,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:38:54,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:38:54,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:38:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:38:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:38:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:38:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:38:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:38:54,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:38:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:38:54,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:38:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:38:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:38:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:38:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:38:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:38:54,259 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:38:55,035 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:38:55,035 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:38:55,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:38:55 BoogieIcfgContainer [2019-12-26 23:38:55,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:38:55,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:38:55,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:38:55,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:38:55,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:38:53" (1/3) ... [2019-12-26 23:38:55,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38974a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:38:55, skipping insertion in model container [2019-12-26 23:38:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:54" (2/3) ... [2019-12-26 23:38:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38974a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:38:55, skipping insertion in model container [2019-12-26 23:38:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:38:55" (3/3) ... [2019-12-26 23:38:55,046 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_rmo.opt.i [2019-12-26 23:38:55,057 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:38:55,058 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:38:55,066 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:38:55,068 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:38:55,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,151 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,151 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,167 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:55,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:38:55,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:38:55,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:38:55,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:38:55,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:38:55,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:38:55,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:38:55,230 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:38:55,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:38:55,251 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 23:38:55,253 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:38:55,360 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:38:55,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:38:55,375 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:38:55,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:38:55,451 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:38:55,451 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:38:55,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:38:55,478 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:38:55,479 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:39:00,021 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-26 23:39:00,385 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:39:00,512 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:39:00,544 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-26 23:39:00,544 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:39:00,548 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-26 23:39:19,768 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-26 23:39:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-26 23:39:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:39:19,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:19,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:39:19,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-26 23:39:19,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161270454] [2019-12-26 23:39:19,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:39:20,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161270454] [2019-12-26 23:39:20,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:20,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:39:20,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479297771] [2019-12-26 23:39:20,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:39:20,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:39:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:39:20,113 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-26 23:39:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:23,306 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-26 23:39:23,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:39:23,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:39:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:24,038 INFO L225 Difference]: With dead ends: 115182 [2019-12-26 23:39:24,038 INFO L226 Difference]: Without dead ends: 112830 [2019-12-26 23:39:24,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:39:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-26 23:39:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-26 23:39:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-26 23:39:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-26 23:39:33,523 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-26 23:39:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:33,524 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-26 23:39:33,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:39:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-26 23:39:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:39:33,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:33,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:33,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-26 23:39:33,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:33,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036560362] [2019-12-26 23:39:33,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:39:33,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036560362] [2019-12-26 23:39:33,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:33,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:39:33,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177867925] [2019-12-26 23:39:33,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:39:33,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:33,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:39:33,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:39:33,634 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-26 23:39:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:39,176 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-26 23:39:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:39:39,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:39:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:39,770 INFO L225 Difference]: With dead ends: 176302 [2019-12-26 23:39:39,770 INFO L226 Difference]: Without dead ends: 176253 [2019-12-26 23:39:39,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:39:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-26 23:39:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-26 23:39:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-26 23:39:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-26 23:39:49,806 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-26 23:39:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:49,806 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-26 23:39:49,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:39:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-26 23:39:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:39:49,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:49,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:49,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-26 23:39:49,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:49,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432682568] [2019-12-26 23:39:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:49,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-26 23:39:49,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432682568] [2019-12-26 23:39:49,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:49,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:39:49,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659001870] [2019-12-26 23:39:49,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:39:49,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:39:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:39:49,948 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-26 23:39:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:56,865 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-26 23:39:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:39:56,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:39:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:57,651 INFO L225 Difference]: With dead ends: 228428 [2019-12-26 23:39:57,651 INFO L226 Difference]: Without dead ends: 228365 [2019-12-26 23:39:57,651 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-26 23:40:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-26 23:40:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-26 23:40:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-26 23:40:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-26 23:40:12,768 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-26 23:40:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:12,769 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-26 23:40:12,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-26 23:40:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:40:12,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:12,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:12,772 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-26 23:40:12,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:12,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064423495] [2019-12-26 23:40:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:12,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064423495] [2019-12-26 23:40:12,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:12,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:12,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130500441] [2019-12-26 23:40:12,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:12,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:12,814 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-26 23:40:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:12,949 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-26 23:40:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:12,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:40:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:13,008 INFO L225 Difference]: With dead ends: 38255 [2019-12-26 23:40:13,008 INFO L226 Difference]: Without dead ends: 38255 [2019-12-26 23:40:13,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-26 23:40:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-26 23:40:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-26 23:40:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-26 23:40:13,654 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-26 23:40:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:13,654 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-26 23:40:13,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-26 23:40:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:40:13,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:13,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:13,659 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-26 23:40:13,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:13,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929809144] [2019-12-26 23:40:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:13,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929809144] [2019-12-26 23:40:13,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:13,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:13,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735135655] [2019-12-26 23:40:13,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:13,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:13,764 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-26 23:40:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:15,990 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-26 23:40:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:40:15,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:40:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:16,067 INFO L225 Difference]: With dead ends: 51712 [2019-12-26 23:40:16,067 INFO L226 Difference]: Without dead ends: 51699 [2019-12-26 23:40:16,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:40:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-26 23:40:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-26 23:40:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-26 23:40:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-26 23:40:16,800 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-26 23:40:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:16,800 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-26 23:40:16,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-26 23:40:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:40:16,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:16,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:16,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-26 23:40:16,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:16,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637756352] [2019-12-26 23:40:16,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:16,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637756352] [2019-12-26 23:40:16,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:16,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:16,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241043468] [2019-12-26 23:40:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:40:16,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:40:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:16,868 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-26 23:40:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:16,909 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-26 23:40:16,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:40:16,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:40:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:16,922 INFO L225 Difference]: With dead ends: 7422 [2019-12-26 23:40:16,922 INFO L226 Difference]: Without dead ends: 7422 [2019-12-26 23:40:16,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-26 23:40:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-26 23:40:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-26 23:40:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-26 23:40:17,030 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-26 23:40:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:17,030 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-26 23:40:17,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-26 23:40:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:40:17,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:17,042 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] [2019-12-26 23:40:17,043 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-26 23:40:17,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:17,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738535989] [2019-12-26 23:40:17,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:17,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738535989] [2019-12-26 23:40:17,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:17,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:40:17,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449211632] [2019-12-26 23:40:17,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:17,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:17,115 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-26 23:40:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:17,164 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-26 23:40:17,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:40:17,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:40:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:17,172 INFO L225 Difference]: With dead ends: 5312 [2019-12-26 23:40:17,173 INFO L226 Difference]: Without dead ends: 5312 [2019-12-26 23:40:17,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-26 23:40:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-26 23:40:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-26 23:40:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-26 23:40:17,248 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-26 23:40:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:17,248 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-26 23:40:17,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-26 23:40:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:40:17,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:17,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:17,258 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-26 23:40:17,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:17,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009467998] [2019-12-26 23:40:17,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:17,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009467998] [2019-12-26 23:40:17,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:17,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:40:17,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369692897] [2019-12-26 23:40:17,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:17,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:17,394 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-26 23:40:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:18,651 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-26 23:40:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:40:18,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:40:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:18,660 INFO L225 Difference]: With dead ends: 7539 [2019-12-26 23:40:18,661 INFO L226 Difference]: Without dead ends: 7539 [2019-12-26 23:40:18,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:40:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-26 23:40:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-26 23:40:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-26 23:40:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-26 23:40:18,747 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-26 23:40:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:18,747 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-26 23:40:18,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-26 23:40:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:40:18,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:18,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:18,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-26 23:40:18,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:18,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737412257] [2019-12-26 23:40:18,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:18,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737412257] [2019-12-26 23:40:18,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:18,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:18,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238871915] [2019-12-26 23:40:18,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:18,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:18,863 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-26 23:40:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:18,889 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-26 23:40:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:18,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:40:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:18,896 INFO L225 Difference]: With dead ends: 5975 [2019-12-26 23:40:18,896 INFO L226 Difference]: Without dead ends: 5975 [2019-12-26 23:40:18,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-26 23:40:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-26 23:40:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-26 23:40:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-26 23:40:18,966 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-26 23:40:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:18,966 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-26 23:40:18,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-26 23:40:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:40:18,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:18,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:18,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-26 23:40:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29585576] [2019-12-26 23:40:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:19,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-26 23:40:19,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29585576] [2019-12-26 23:40:19,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:19,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:40:19,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803532839] [2019-12-26 23:40:19,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:19,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:19,079 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-26 23:40:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:19,388 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-26 23:40:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:40:19,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:40:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:19,399 INFO L225 Difference]: With dead ends: 8394 [2019-12-26 23:40:19,399 INFO L226 Difference]: Without dead ends: 8394 [2019-12-26 23:40:19,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:40:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-26 23:40:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-26 23:40:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-26 23:40:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-26 23:40:19,487 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-26 23:40:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:19,488 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-26 23:40:19,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-26 23:40:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:40:19,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:19,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:19,497 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-26 23:40:19,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:19,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649937023] [2019-12-26 23:40:19,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:19,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649937023] [2019-12-26 23:40:19,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:19,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:19,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490734431] [2019-12-26 23:40:19,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:19,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:19,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:19,592 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-26 23:40:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:19,618 INFO L93 Difference]: Finished difference Result 5518 states and 15469 transitions. [2019-12-26 23:40:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:19,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:40:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:19,625 INFO L225 Difference]: With dead ends: 5518 [2019-12-26 23:40:19,625 INFO L226 Difference]: Without dead ends: 5518 [2019-12-26 23:40:19,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-26 23:40:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5170. [2019-12-26 23:40:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-26 23:40:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-26 23:40:19,724 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-26 23:40:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:19,724 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-26 23:40:19,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-26 23:40:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:19,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:19,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:19,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-26 23:40:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:19,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774040151] [2019-12-26 23:40:19,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:20,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774040151] [2019-12-26 23:40:20,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:20,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:40:20,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219780444] [2019-12-26 23:40:20,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:40:20,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:40:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:40:20,022 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 13 states. [2019-12-26 23:40:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:20,675 INFO L93 Difference]: Finished difference Result 10542 states and 29542 transitions. [2019-12-26 23:40:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:40:20,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-26 23:40:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:20,685 INFO L225 Difference]: With dead ends: 10542 [2019-12-26 23:40:20,685 INFO L226 Difference]: Without dead ends: 5832 [2019-12-26 23:40:20,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:40:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2019-12-26 23:40:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 4872. [2019-12-26 23:40:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-12-26 23:40:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 13645 transitions. [2019-12-26 23:40:20,757 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 13645 transitions. Word has length 67 [2019-12-26 23:40:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:20,757 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 13645 transitions. [2019-12-26 23:40:20,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:40:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 13645 transitions. [2019-12-26 23:40:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:20,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:20,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:20,764 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash 499610268, now seen corresponding path program 2 times [2019-12-26 23:40:20,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:20,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680355760] [2019-12-26 23:40:20,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:20,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680355760] [2019-12-26 23:40:20,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:20,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:40:20,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259982878] [2019-12-26 23:40:20,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:40:20,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:40:20,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:40:20,894 INFO L87 Difference]: Start difference. First operand 4872 states and 13645 transitions. Second operand 7 states. [2019-12-26 23:40:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:21,802 INFO L93 Difference]: Finished difference Result 7161 states and 19868 transitions. [2019-12-26 23:40:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:40:21,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-26 23:40:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:21,812 INFO L225 Difference]: With dead ends: 7161 [2019-12-26 23:40:21,812 INFO L226 Difference]: Without dead ends: 7161 [2019-12-26 23:40:21,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:40:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2019-12-26 23:40:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 5279. [2019-12-26 23:40:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2019-12-26 23:40:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 14775 transitions. [2019-12-26 23:40:21,894 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 14775 transitions. Word has length 67 [2019-12-26 23:40:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:21,894 INFO L462 AbstractCegarLoop]: Abstraction has 5279 states and 14775 transitions. [2019-12-26 23:40:21,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:40:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 14775 transitions. [2019-12-26 23:40:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:21,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:21,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:21,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1057080962, now seen corresponding path program 3 times [2019-12-26 23:40:21,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:21,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912692074] [2019-12-26 23:40:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:21,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912692074] [2019-12-26 23:40:21,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:21,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:21,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403559891] [2019-12-26 23:40:21,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:21,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:21,975 INFO L87 Difference]: Start difference. First operand 5279 states and 14775 transitions. Second operand 3 states. [2019-12-26 23:40:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:23,610 INFO L93 Difference]: Finished difference Result 5278 states and 14773 transitions. [2019-12-26 23:40:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:23,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:40:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:23,618 INFO L225 Difference]: With dead ends: 5278 [2019-12-26 23:40:23,618 INFO L226 Difference]: Without dead ends: 5278 [2019-12-26 23:40:23,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2019-12-26 23:40:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 2810. [2019-12-26 23:40:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-26 23:40:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-26 23:40:23,680 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-26 23:40:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:23,680 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-26 23:40:23,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-26 23:40:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:23,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:23,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:23,684 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-26 23:40:23,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:23,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769015879] [2019-12-26 23:40:23,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:23,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769015879] [2019-12-26 23:40:23,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:23,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:40:23,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37737764] [2019-12-26 23:40:23,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:40:23,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:23,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:40:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:40:23,899 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 13 states. [2019-12-26 23:40:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:24,382 INFO L93 Difference]: Finished difference Result 4966 states and 13960 transitions. [2019-12-26 23:40:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:40:24,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-26 23:40:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:24,393 INFO L225 Difference]: With dead ends: 4966 [2019-12-26 23:40:24,394 INFO L226 Difference]: Without dead ends: 4941 [2019-12-26 23:40:24,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:40:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2019-12-26 23:40:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3941. [2019-12-26 23:40:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-26 23:40:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-26 23:40:24,529 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-26 23:40:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:24,529 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-26 23:40:24,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:40:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-26 23:40:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:24,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:24,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:24,541 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-26 23:40:24,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:24,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563840616] [2019-12-26 23:40:24,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563840616] [2019-12-26 23:40:25,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:40:25,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925732774] [2019-12-26 23:40:25,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:40:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:40:25,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:40:25,164 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 19 states. [2019-12-26 23:40:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:27,621 INFO L93 Difference]: Finished difference Result 10519 states and 29125 transitions. [2019-12-26 23:40:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 23:40:27,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:40:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:27,635 INFO L225 Difference]: With dead ends: 10519 [2019-12-26 23:40:27,635 INFO L226 Difference]: Without dead ends: 10494 [2019-12-26 23:40:27,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 23:40:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2019-12-26 23:40:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 4118. [2019-12-26 23:40:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4118 states. [2019-12-26 23:40:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 11512 transitions. [2019-12-26 23:40:27,730 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 11512 transitions. Word has length 68 [2019-12-26 23:40:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:27,731 INFO L462 AbstractCegarLoop]: Abstraction has 4118 states and 11512 transitions. [2019-12-26 23:40:27,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:40:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 11512 transitions. [2019-12-26 23:40:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:27,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:27,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:27,738 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash 209870412, now seen corresponding path program 3 times [2019-12-26 23:40:27,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:27,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931816479] [2019-12-26 23:40:27,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:27,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931816479] [2019-12-26 23:40:27,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:27,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:40:27,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477588314] [2019-12-26 23:40:27,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:40:27,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:27,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:40:27,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:40:27,943 INFO L87 Difference]: Start difference. First operand 4118 states and 11512 transitions. Second operand 13 states. [2019-12-26 23:40:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:28,497 INFO L93 Difference]: Finished difference Result 6802 states and 18867 transitions. [2019-12-26 23:40:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:40:28,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-26 23:40:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:28,511 INFO L225 Difference]: With dead ends: 6802 [2019-12-26 23:40:28,512 INFO L226 Difference]: Without dead ends: 6777 [2019-12-26 23:40:28,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:40:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6777 states. [2019-12-26 23:40:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6777 to 4162. [2019-12-26 23:40:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-26 23:40:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-26 23:40:28,662 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-26 23:40:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:28,662 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-26 23:40:28,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:40:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-26 23:40:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:28,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:28,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:28,671 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 4 times [2019-12-26 23:40:28,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:28,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431815477] [2019-12-26 23:40:28,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:29,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431815477] [2019-12-26 23:40:29,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:29,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:40:29,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198142826] [2019-12-26 23:40:29,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:40:29,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:29,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:40:29,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:40:29,440 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 20 states. [2019-12-26 23:40:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:32,244 INFO L93 Difference]: Finished difference Result 12283 states and 33999 transitions. [2019-12-26 23:40:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 23:40:32,245 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-26 23:40:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:32,263 INFO L225 Difference]: With dead ends: 12283 [2019-12-26 23:40:32,263 INFO L226 Difference]: Without dead ends: 12258 [2019-12-26 23:40:32,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=469, Invalid=2287, Unknown=0, NotChecked=0, Total=2756 [2019-12-26 23:40:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-12-26 23:40:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 4389. [2019-12-26 23:40:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2019-12-26 23:40:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 12291 transitions. [2019-12-26 23:40:32,369 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 12291 transitions. Word has length 68 [2019-12-26 23:40:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:32,370 INFO L462 AbstractCegarLoop]: Abstraction has 4389 states and 12291 transitions. [2019-12-26 23:40:32,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:40:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 12291 transitions. [2019-12-26 23:40:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:32,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:32,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:32,374 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 5 times [2019-12-26 23:40:32,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:32,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665502847] [2019-12-26 23:40:32,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665502847] [2019-12-26 23:40:32,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:32,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:40:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606445471] [2019-12-26 23:40:32,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:40:32,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:40:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:40:32,867 INFO L87 Difference]: Start difference. First operand 4389 states and 12291 transitions. Second operand 19 states. [2019-12-26 23:40:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:36,192 INFO L93 Difference]: Finished difference Result 12857 states and 35721 transitions. [2019-12-26 23:40:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-26 23:40:36,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:40:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:36,209 INFO L225 Difference]: With dead ends: 12857 [2019-12-26 23:40:36,209 INFO L226 Difference]: Without dead ends: 12832 [2019-12-26 23:40:36,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=460, Invalid=2620, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 23:40:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12832 states. [2019-12-26 23:40:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12832 to 4599. [2019-12-26 23:40:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-26 23:40:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 12919 transitions. [2019-12-26 23:40:36,310 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 12919 transitions. Word has length 68 [2019-12-26 23:40:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:36,311 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 12919 transitions. [2019-12-26 23:40:36,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:40:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 12919 transitions. [2019-12-26 23:40:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:36,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:36,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:36,315 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 932771090, now seen corresponding path program 6 times [2019-12-26 23:40:36,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:36,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431437343] [2019-12-26 23:40:36,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:37,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431437343] [2019-12-26 23:40:37,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:37,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:40:37,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90568899] [2019-12-26 23:40:37,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:40:37,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:40:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:40:37,014 INFO L87 Difference]: Start difference. First operand 4599 states and 12919 transitions. Second operand 20 states. [2019-12-26 23:40:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:40,693 INFO L93 Difference]: Finished difference Result 12467 states and 34706 transitions. [2019-12-26 23:40:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-26 23:40:40,695 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-26 23:40:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:40,711 INFO L225 Difference]: With dead ends: 12467 [2019-12-26 23:40:40,711 INFO L226 Difference]: Without dead ends: 12442 [2019-12-26 23:40:40,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=499, Invalid=2923, Unknown=0, NotChecked=0, Total=3422 [2019-12-26 23:40:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12442 states. [2019-12-26 23:40:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12442 to 4517. [2019-12-26 23:40:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-12-26 23:40:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 12672 transitions. [2019-12-26 23:40:40,850 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 12672 transitions. Word has length 68 [2019-12-26 23:40:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:40,851 INFO L462 AbstractCegarLoop]: Abstraction has 4517 states and 12672 transitions. [2019-12-26 23:40:40,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:40:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 12672 transitions. [2019-12-26 23:40:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:40,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:40,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:40,855 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1425961288, now seen corresponding path program 7 times [2019-12-26 23:40:40,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:40,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555295055] [2019-12-26 23:40:40,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:41,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555295055] [2019-12-26 23:40:41,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:41,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:40:41,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839673325] [2019-12-26 23:40:41,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:40:41,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:40:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:40:41,071 INFO L87 Difference]: Start difference. First operand 4517 states and 12672 transitions. Second operand 14 states. [2019-12-26 23:40:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:41,777 INFO L93 Difference]: Finished difference Result 6473 states and 17960 transitions. [2019-12-26 23:40:41,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:40:41,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 23:40:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:41,786 INFO L225 Difference]: With dead ends: 6473 [2019-12-26 23:40:41,786 INFO L226 Difference]: Without dead ends: 6448 [2019-12-26 23:40:41,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:40:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2019-12-26 23:40:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 4062. [2019-12-26 23:40:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-26 23:40:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-26 23:40:41,854 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-26 23:40:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:41,854 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-26 23:40:41,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:40:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-26 23:40:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:41,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:41,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:41,858 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 8 times [2019-12-26 23:40:41,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237385448] [2019-12-26 23:40:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:40:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:40:42,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:40:42,038 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:40:42,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1976~0.base_23|) |v_ULTIMATE.start_main_~#t1976~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1976~0.offset_17|) (= v_~z$w_buff1_used~0_381 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1976~0.base_23| 4)) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1976~0.base_23| 1)) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1976~0.base_23|) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_~#t1976~0.base=|v_ULTIMATE.start_main_~#t1976~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1976~0.offset=|v_ULTIMATE.start_main_~#t1976~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194, ULTIMATE.start_main_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1977~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1976~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1976~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1977~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1978~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-26 23:40:42,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1977~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1977~0.base_11|) |v_ULTIMATE.start_main_~#t1977~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1977~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1977~0.base_11|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1977~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1977~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1977~0.base=|v_ULTIMATE.start_main_~#t1977~0.base_11|, ULTIMATE.start_main_~#t1977~0.offset=|v_ULTIMATE.start_main_~#t1977~0.offset_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1977~0.base, ULTIMATE.start_main_~#t1977~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:40:42,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:40:42,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1978~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1978~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1978~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1978~0.base_12|) |v_ULTIMATE.start_main_~#t1978~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12| 1)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1978~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t1978~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1978~0.offset=|v_ULTIMATE.start_main_~#t1978~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1978~0.base=|v_ULTIMATE.start_main_~#t1978~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1978~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1978~0.base] because there is no mapped edge [2019-12-26 23:40:42,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1803934567 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1803934567 256)))) (or (and (= ~z$w_buff0_used~0_In-1803934567 |P0Thread1of1ForFork0_#t~ite5_Out-1803934567|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1803934567|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1803934567, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1803934567} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1803934567|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1803934567, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1803934567} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:40:42,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-75133317 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-75133317 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-75133317 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-75133317 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-75133317 |P0Thread1of1ForFork0_#t~ite6_Out-75133317|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-75133317|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-75133317, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-75133317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-75133317, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-75133317} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-75133317|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-75133317, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-75133317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-75133317, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-75133317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:40:42,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1082308797 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1082308797 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1082308797 ~z$r_buff0_thd1~0_In1082308797) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out1082308797 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1082308797, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1082308797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1082308797, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1082308797|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1082308797} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:40:42,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1150261458 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1150261458 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1150261458 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1150261458 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1150261458| ~z$r_buff1_thd1~0_In-1150261458) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1150261458|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150261458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1150261458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150261458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1150261458} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1150261458, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1150261458|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1150261458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1150261458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1150261458} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:40:42,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:40:42,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1747683765 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1747683765 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1747683765 |P1Thread1of1ForFork1_#t~ite9_Out1747683765|)) (and (not .cse1) (= ~z$w_buff1~0_In1747683765 |P1Thread1of1ForFork1_#t~ite9_Out1747683765|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1747683765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747683765, ~z$w_buff1~0=~z$w_buff1~0_In1747683765, ~z~0=~z~0_In1747683765} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1747683765|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1747683765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747683765, ~z$w_buff1~0=~z$w_buff1~0_In1747683765, ~z~0=~z~0_In1747683765} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:40:42,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 23:40:42,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1162105079 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1162105079 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1162105079| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1162105079| ~z$w_buff0_used~0_In1162105079) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1162105079, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1162105079} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1162105079, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1162105079|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1162105079} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:40:42,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1907112121 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1907112121 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1907112121| ~z~0_In1907112121) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1907112121| ~z$w_buff1~0_In1907112121) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1907112121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1907112121, ~z$w_buff1~0=~z$w_buff1~0_In1907112121, ~z~0=~z~0_In1907112121} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1907112121|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1907112121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1907112121, ~z$w_buff1~0=~z$w_buff1~0_In1907112121, ~z~0=~z~0_In1907112121} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:40:42,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1673044009 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1673044009 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1673044009 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1673044009 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1673044009 |P1Thread1of1ForFork1_#t~ite12_Out1673044009|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1673044009|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1673044009, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1673044009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673044009, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1673044009} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1673044009, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1673044009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673044009, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1673044009|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1673044009} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:40:42,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In355427972 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In355427972 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out355427972| ~z$r_buff0_thd2~0_In355427972) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out355427972| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In355427972, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In355427972} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In355427972, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out355427972|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In355427972} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:40:42,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:40:42,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-457659351 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-457659351 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-457659351|)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-457659351| ~z$w_buff0_used~0_In-457659351) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-457659351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457659351} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-457659351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457659351, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-457659351|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:40:42,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In964017869 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In964017869 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In964017869 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In964017869 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out964017869| ~z$w_buff1_used~0_In964017869)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out964017869| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In964017869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In964017869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In964017869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In964017869} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In964017869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In964017869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In964017869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In964017869, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out964017869|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:40:42,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1023223670 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1023223670 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1023223670 |P2Thread1of1ForFork2_#t~ite19_Out-1023223670|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1023223670|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1023223670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1023223670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1023223670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1023223670, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1023223670|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:40:42,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-658204898 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-658204898 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-658204898 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-658204898 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-658204898|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-658204898 |P2Thread1of1ForFork2_#t~ite20_Out-658204898|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-658204898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-658204898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658204898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-658204898} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-658204898, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-658204898|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-658204898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658204898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-658204898} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:40:42,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:40:42,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1520765892 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1520765892 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1520765892 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1520765892 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1520765892| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1520765892 |P1Thread1of1ForFork1_#t~ite14_Out-1520765892|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520765892, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1520765892, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520765892, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1520765892} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520765892, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1520765892, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520765892, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1520765892|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1520765892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:40:42,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:40:42,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:40:42,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-551793864 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-551793864 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-551793864| ~z~0_In-551793864)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-551793864| ~z$w_buff1~0_In-551793864)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-551793864, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-551793864, ~z$w_buff1~0=~z$w_buff1~0_In-551793864, ~z~0=~z~0_In-551793864} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-551793864, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-551793864|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-551793864, ~z$w_buff1~0=~z$w_buff1~0_In-551793864, ~z~0=~z~0_In-551793864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 23:40:42,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-26 23:40:42,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-689950259 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-689950259 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-689950259| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out-689950259| ~z$w_buff0_used~0_In-689950259) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-689950259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-689950259} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-689950259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-689950259, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-689950259|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:40:42,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1278636443 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1278636443 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1278636443 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1278636443 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1278636443|)) (and (= ~z$w_buff1_used~0_In-1278636443 |ULTIMATE.start_main_#t~ite27_Out-1278636443|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1278636443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1278636443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1278636443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1278636443} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1278636443, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1278636443, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1278636443, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1278636443, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1278636443|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:40:42,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1897584112 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1897584112 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1897584112|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1897584112 |ULTIMATE.start_main_#t~ite28_Out-1897584112|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1897584112, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897584112} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1897584112, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1897584112|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897584112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:40:42,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In689514482 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In689514482 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In689514482 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In689514482 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In689514482 |ULTIMATE.start_main_#t~ite29_Out689514482|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out689514482| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In689514482, ~z$w_buff0_used~0=~z$w_buff0_used~0_In689514482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In689514482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In689514482} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In689514482, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out689514482|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In689514482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In689514482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In689514482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:40:42,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:40:42,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:40:42,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:40:42,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:40:42 BasicIcfg [2019-12-26 23:40:42,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:40:42,256 INFO L168 Benchmark]: Toolchain (without parser) took 109093.54 ms. Allocated memory was 140.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 608.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,257 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.28 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 103.4 MB in the beginning and 158.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 206.6 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,261 INFO L168 Benchmark]: Boogie Preprocessor took 50.92 ms. Allocated memory is still 206.6 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,262 INFO L168 Benchmark]: RCFGBuilder took 869.58 ms. Allocated memory is still 206.6 MB. Free memory was 152.8 MB in the beginning and 102.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,265 INFO L168 Benchmark]: TraceAbstraction took 107214.66 ms. Allocated memory was 206.6 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 540.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:42,274 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.39 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 880.28 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 103.4 MB in the beginning and 158.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 206.6 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.92 ms. Allocated memory is still 206.6 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.58 ms. Allocated memory is still 206.6 MB. Free memory was 152.8 MB in the beginning and 102.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107214.66 ms. Allocated memory was 206.6 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 540.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1976, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1977, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1978, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 5281 SDslu, 15084 SDs, 0 SdLazy, 14052 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 30 SyntacticMatches, 26 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3243 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 111887 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 398769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...