/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:26:03,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:26:03,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:26:03,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:26:03,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:26:03,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:26:03,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:26:03,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:26:03,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:26:03,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:26:03,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:26:03,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:26:03,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:26:03,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:26:03,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:26:03,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:26:03,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:26:03,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:26:03,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:26:03,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:26:03,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:26:03,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:26:03,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:26:03,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:26:03,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:26:03,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:26:03,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:26:03,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:26:03,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:26:03,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:26:03,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:26:03,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:26:03,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:26:03,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:26:03,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:26:03,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:26:03,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:26:03,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:26:03,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:26:03,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:26:03,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:26:03,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:26:03,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:26:03,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:26:03,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:26:03,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:26:03,909 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:26:03,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:26:03,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:26:03,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:26:03,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:26:03,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:26:03,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:26:03,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:26:03,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:26:03,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:26:03,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:26:03,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:26:03,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:26:03,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:26:03,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:26:03,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:26:03,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:26:03,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:26:03,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:26:03,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:26:03,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:26:03,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:26:03,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:26:03,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:26:03,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:26:03,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:26:04,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:26:04,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:26:04,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:26:04,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:26:04,213 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:26:04,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 21:26:04,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57d8ce50/f3ae97fe7c35492ba743bc220bd47a6d/FLAG4e3d9b271 [2019-12-18 21:26:04,886 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:26:04,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 21:26:04,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57d8ce50/f3ae97fe7c35492ba743bc220bd47a6d/FLAG4e3d9b271 [2019-12-18 21:26:05,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57d8ce50/f3ae97fe7c35492ba743bc220bd47a6d [2019-12-18 21:26:05,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:26:05,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:26:05,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:26:05,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:26:05,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:26:05,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:05,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752dce1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05, skipping insertion in model container [2019-12-18 21:26:05,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:05,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:26:05,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:26:05,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:26:05,793 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:26:05,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:26:05,941 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:26:05,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05 WrapperNode [2019-12-18 21:26:05,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:26:05,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:26:05,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:26:05,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:26:05,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:05,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:26:06,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:26:06,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:26:06,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:26:06,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (1/1) ... [2019-12-18 21:26:06,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:26:06,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:26:06,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:26:06,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:26:06,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (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-18 21:26:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:26:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:26:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:26:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:26:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:26:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:26:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:26:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:26:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:26:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:26:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:26:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:26:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:26:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:26:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:26:06,119 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:26:06,859 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:26:06,859 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:26:06,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:26:06 BoogieIcfgContainer [2019-12-18 21:26:06,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:26:06,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:26:06,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:26:06,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:26:06,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:26:05" (1/3) ... [2019-12-18 21:26:06,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659cc315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:26:06, skipping insertion in model container [2019-12-18 21:26:06,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:05" (2/3) ... [2019-12-18 21:26:06,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659cc315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:26:06, skipping insertion in model container [2019-12-18 21:26:06,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:26:06" (3/3) ... [2019-12-18 21:26:06,870 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-18 21:26:06,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:26:06,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:26:06,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:26:06,889 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:26:06,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,948 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,948 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,948 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,949 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,949 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,970 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,971 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,972 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,973 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,987 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,987 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,989 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:06,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:07,005 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:26:07,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:26:07,023 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:26:07,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:26:07,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:26:07,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:26:07,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:26:07,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:26:07,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:26:07,042 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 21:26:07,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:26:07,129 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:26:07,130 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:26:07,146 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:26:07,167 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:26:07,240 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:26:07,240 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:26:07,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:26:07,267 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:26:07,268 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:26:10,972 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 21:26:11,155 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 21:26:11,185 INFO L206 etLargeBlockEncoding]: Checked pairs total: 57720 [2019-12-18 21:26:11,185 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 21:26:11,189 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 98 transitions [2019-12-18 21:26:13,448 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:26:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:26:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:26:13,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:13,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:13,459 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 86209296, now seen corresponding path program 1 times [2019-12-18 21:26:13,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:13,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089971527] [2019-12-18 21:26:13,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:13,820 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-18 21:26:13,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089971527] [2019-12-18 21:26:13,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:13,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:26:13,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297287362] [2019-12-18 21:26:13,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:13,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:13,847 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:26:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:15,095 INFO L93 Difference]: Finished difference Result 34422 states and 146848 transitions. [2019-12-18 21:26:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:15,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:26:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:15,359 INFO L225 Difference]: With dead ends: 34422 [2019-12-18 21:26:15,359 INFO L226 Difference]: Without dead ends: 33750 [2019-12-18 21:26:15,362 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-18 21:26:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33750 states. [2019-12-18 21:26:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33750 to 33750. [2019-12-18 21:26:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33750 states. [2019-12-18 21:26:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33750 states to 33750 states and 144104 transitions. [2019-12-18 21:26:17,299 INFO L78 Accepts]: Start accepts. Automaton has 33750 states and 144104 transitions. Word has length 9 [2019-12-18 21:26:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:17,300 INFO L462 AbstractCegarLoop]: Abstraction has 33750 states and 144104 transitions. [2019-12-18 21:26:17,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 33750 states and 144104 transitions. [2019-12-18 21:26:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:26:17,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:17,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:17,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2020718279, now seen corresponding path program 1 times [2019-12-18 21:26:17,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:17,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417701059] [2019-12-18 21:26:17,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:17,398 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-18 21:26:17,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417701059] [2019-12-18 21:26:17,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:17,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:17,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748847553] [2019-12-18 21:26:17,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:17,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:17,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:17,401 INFO L87 Difference]: Start difference. First operand 33750 states and 144104 transitions. Second operand 4 states. [2019-12-18 21:26:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:19,605 INFO L93 Difference]: Finished difference Result 52526 states and 216740 transitions. [2019-12-18 21:26:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:26:19,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:26:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:19,843 INFO L225 Difference]: With dead ends: 52526 [2019-12-18 21:26:19,843 INFO L226 Difference]: Without dead ends: 52498 [2019-12-18 21:26:19,844 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-18 21:26:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52498 states. [2019-12-18 21:26:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52498 to 47958. [2019-12-18 21:26:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47958 states. [2019-12-18 21:26:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47958 states to 47958 states and 199860 transitions. [2019-12-18 21:26:22,255 INFO L78 Accepts]: Start accepts. Automaton has 47958 states and 199860 transitions. Word has length 15 [2019-12-18 21:26:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 47958 states and 199860 transitions. [2019-12-18 21:26:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:26:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47958 states and 199860 transitions. [2019-12-18 21:26:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:26:22,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:22,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:22,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1977980563, now seen corresponding path program 1 times [2019-12-18 21:26:22,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:22,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956597336] [2019-12-18 21:26:22,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:22,382 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-18 21:26:22,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956597336] [2019-12-18 21:26:22,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:22,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718955892] [2019-12-18 21:26:22,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:22,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:22,388 INFO L87 Difference]: Start difference. First operand 47958 states and 199860 transitions. Second operand 4 states. [2019-12-18 21:26:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:22,863 INFO L93 Difference]: Finished difference Result 59070 states and 244072 transitions. [2019-12-18 21:26:22,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:26:22,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:26:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:23,028 INFO L225 Difference]: With dead ends: 59070 [2019-12-18 21:26:23,028 INFO L226 Difference]: Without dead ends: 59070 [2019-12-18 21:26:23,029 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-18 21:26:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59070 states. [2019-12-18 21:26:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59070 to 53006. [2019-12-18 21:26:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53006 states. [2019-12-18 21:26:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53006 states to 53006 states and 220392 transitions. [2019-12-18 21:26:26,944 INFO L78 Accepts]: Start accepts. Automaton has 53006 states and 220392 transitions. Word has length 15 [2019-12-18 21:26:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:26,944 INFO L462 AbstractCegarLoop]: Abstraction has 53006 states and 220392 transitions. [2019-12-18 21:26:26,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:26:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 53006 states and 220392 transitions. [2019-12-18 21:26:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:26:26,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:26,956 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] [2019-12-18 21:26:26,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:26,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash -587282460, now seen corresponding path program 1 times [2019-12-18 21:26:26,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:26,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839084570] [2019-12-18 21:26:26,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:27,036 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-18 21:26:27,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839084570] [2019-12-18 21:26:27,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:27,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:27,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439874126] [2019-12-18 21:26:27,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:26:27,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:26:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:26:27,039 INFO L87 Difference]: Start difference. First operand 53006 states and 220392 transitions. Second operand 5 states. [2019-12-18 21:26:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:27,850 INFO L93 Difference]: Finished difference Result 70534 states and 288484 transitions. [2019-12-18 21:26:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:26:27,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:26:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:30,311 INFO L225 Difference]: With dead ends: 70534 [2019-12-18 21:26:30,311 INFO L226 Difference]: Without dead ends: 70506 [2019-12-18 21:26:30,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70506 states. [2019-12-18 21:26:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70506 to 52682. [2019-12-18 21:26:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52682 states. [2019-12-18 21:26:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52682 states to 52682 states and 218712 transitions. [2019-12-18 21:26:31,679 INFO L78 Accepts]: Start accepts. Automaton has 52682 states and 218712 transitions. Word has length 21 [2019-12-18 21:26:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:31,679 INFO L462 AbstractCegarLoop]: Abstraction has 52682 states and 218712 transitions. [2019-12-18 21:26:31,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:26:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52682 states and 218712 transitions. [2019-12-18 21:26:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:26:31,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:31,718 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] [2019-12-18 21:26:31,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1693897678, now seen corresponding path program 1 times [2019-12-18 21:26:31,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:31,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934234356] [2019-12-18 21:26:31,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:31,772 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-18 21:26:31,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934234356] [2019-12-18 21:26:31,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:31,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:31,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180089863] [2019-12-18 21:26:31,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:31,777 INFO L87 Difference]: Start difference. First operand 52682 states and 218712 transitions. Second operand 3 states. [2019-12-18 21:26:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:32,694 INFO L93 Difference]: Finished difference Result 65362 states and 268648 transitions. [2019-12-18 21:26:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:32,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 21:26:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:32,871 INFO L225 Difference]: With dead ends: 65362 [2019-12-18 21:26:32,871 INFO L226 Difference]: Without dead ends: 65362 [2019-12-18 21:26:32,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65362 states. [2019-12-18 21:26:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65362 to 57878. [2019-12-18 21:26:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57878 states. [2019-12-18 21:26:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57878 states to 57878 states and 239624 transitions. [2019-12-18 21:26:36,710 INFO L78 Accepts]: Start accepts. Automaton has 57878 states and 239624 transitions. Word has length 29 [2019-12-18 21:26:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:36,711 INFO L462 AbstractCegarLoop]: Abstraction has 57878 states and 239624 transitions. [2019-12-18 21:26:36,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 57878 states and 239624 transitions. [2019-12-18 21:26:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:26:36,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:36,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:36,745 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1910359084, now seen corresponding path program 1 times [2019-12-18 21:26:36,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:36,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709365513] [2019-12-18 21:26:36,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:36,833 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-18 21:26:36,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709365513] [2019-12-18 21:26:36,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:36,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:26:36,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044849015] [2019-12-18 21:26:36,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:26:36,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:26:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:26:36,835 INFO L87 Difference]: Start difference. First operand 57878 states and 239624 transitions. Second operand 6 states. [2019-12-18 21:26:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:38,131 INFO L93 Difference]: Finished difference Result 82714 states and 336740 transitions. [2019-12-18 21:26:38,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:26:38,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:26:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:38,366 INFO L225 Difference]: With dead ends: 82714 [2019-12-18 21:26:38,366 INFO L226 Difference]: Without dead ends: 82650 [2019-12-18 21:26:38,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82650 states. [2019-12-18 21:26:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82650 to 66690. [2019-12-18 21:26:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66690 states. [2019-12-18 21:26:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66690 states to 66690 states and 274804 transitions. [2019-12-18 21:26:42,577 INFO L78 Accepts]: Start accepts. Automaton has 66690 states and 274804 transitions. Word has length 29 [2019-12-18 21:26:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 66690 states and 274804 transitions. [2019-12-18 21:26:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:26:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 66690 states and 274804 transitions. [2019-12-18 21:26:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:26:42,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:42,649 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] [2019-12-18 21:26:42,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1476951563, now seen corresponding path program 1 times [2019-12-18 21:26:42,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:42,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697262438] [2019-12-18 21:26:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:42,774 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-18 21:26:42,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697262438] [2019-12-18 21:26:42,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:42,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:26:42,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759640735] [2019-12-18 21:26:42,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:42,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:42,777 INFO L87 Difference]: Start difference. First operand 66690 states and 274804 transitions. Second operand 7 states. [2019-12-18 21:26:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:44,593 INFO L93 Difference]: Finished difference Result 90854 states and 367944 transitions. [2019-12-18 21:26:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:26:44,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 21:26:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:44,852 INFO L225 Difference]: With dead ends: 90854 [2019-12-18 21:26:44,852 INFO L226 Difference]: Without dead ends: 90750 [2019-12-18 21:26:44,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:26:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90750 states. [2019-12-18 21:26:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90750 to 59942. [2019-12-18 21:26:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59942 states. [2019-12-18 21:26:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59942 states to 59942 states and 248164 transitions. [2019-12-18 21:26:47,016 INFO L78 Accepts]: Start accepts. Automaton has 59942 states and 248164 transitions. Word has length 35 [2019-12-18 21:26:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:47,017 INFO L462 AbstractCegarLoop]: Abstraction has 59942 states and 248164 transitions. [2019-12-18 21:26:47,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 59942 states and 248164 transitions. [2019-12-18 21:26:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:26:47,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:47,071 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] [2019-12-18 21:26:47,072 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash -29640414, now seen corresponding path program 1 times [2019-12-18 21:26:47,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:47,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049048568] [2019-12-18 21:26:47,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:47,193 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-18 21:26:47,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049048568] [2019-12-18 21:26:47,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:47,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:47,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673520835] [2019-12-18 21:26:47,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:26:47,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:26:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:26:47,196 INFO L87 Difference]: Start difference. First operand 59942 states and 248164 transitions. Second operand 5 states. [2019-12-18 21:26:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:50,128 INFO L93 Difference]: Finished difference Result 61906 states and 256028 transitions. [2019-12-18 21:26:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:26:50,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-18 21:26:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:50,281 INFO L225 Difference]: With dead ends: 61906 [2019-12-18 21:26:50,281 INFO L226 Difference]: Without dead ends: 59254 [2019-12-18 21:26:50,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:26:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59254 states. [2019-12-18 21:26:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59254 to 59254. [2019-12-18 21:26:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59254 states. [2019-12-18 21:26:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59254 states to 59254 states and 245100 transitions. [2019-12-18 21:26:51,912 INFO L78 Accepts]: Start accepts. Automaton has 59254 states and 245100 transitions. Word has length 35 [2019-12-18 21:26:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:51,912 INFO L462 AbstractCegarLoop]: Abstraction has 59254 states and 245100 transitions. [2019-12-18 21:26:51,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:26:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 59254 states and 245100 transitions. [2019-12-18 21:26:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 21:26:51,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:51,989 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] [2019-12-18 21:26:51,989 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1282093875, now seen corresponding path program 1 times [2019-12-18 21:26:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:51,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956720927] [2019-12-18 21:26:51,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:52,037 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-18 21:26:52,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956720927] [2019-12-18 21:26:52,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:52,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:52,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383251112] [2019-12-18 21:26:52,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:52,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:52,039 INFO L87 Difference]: Start difference. First operand 59254 states and 245100 transitions. Second operand 3 states. [2019-12-18 21:26:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:52,512 INFO L93 Difference]: Finished difference Result 59254 states and 244380 transitions. [2019-12-18 21:26:52,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:52,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 21:26:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:52,685 INFO L225 Difference]: With dead ends: 59254 [2019-12-18 21:26:52,685 INFO L226 Difference]: Without dead ends: 59254 [2019-12-18 21:26:52,685 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-18 21:26:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59254 states. [2019-12-18 21:26:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59254 to 59254. [2019-12-18 21:26:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59254 states. [2019-12-18 21:26:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59254 states to 59254 states and 244380 transitions. [2019-12-18 21:26:54,540 INFO L78 Accepts]: Start accepts. Automaton has 59254 states and 244380 transitions. Word has length 36 [2019-12-18 21:26:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:54,540 INFO L462 AbstractCegarLoop]: Abstraction has 59254 states and 244380 transitions. [2019-12-18 21:26:54,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59254 states and 244380 transitions. [2019-12-18 21:26:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:26:54,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:54,599 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-18 21:26:54,599 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2137371719, now seen corresponding path program 1 times [2019-12-18 21:26:54,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:54,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109624581] [2019-12-18 21:26:54,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:54,659 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-18 21:26:54,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109624581] [2019-12-18 21:26:54,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:54,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:54,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380577548] [2019-12-18 21:26:54,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:54,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:54,662 INFO L87 Difference]: Start difference. First operand 59254 states and 244380 transitions. Second operand 4 states. [2019-12-18 21:26:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:54,917 INFO L93 Difference]: Finished difference Result 47657 states and 180777 transitions. [2019-12-18 21:26:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:26:54,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-18 21:26:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:55,017 INFO L225 Difference]: With dead ends: 47657 [2019-12-18 21:26:55,017 INFO L226 Difference]: Without dead ends: 46549 [2019-12-18 21:26:55,018 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-18 21:26:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46549 states. [2019-12-18 21:26:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46549 to 46549. [2019-12-18 21:26:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46549 states. [2019-12-18 21:26:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46549 states to 46549 states and 177301 transitions. [2019-12-18 21:26:58,282 INFO L78 Accepts]: Start accepts. Automaton has 46549 states and 177301 transitions. Word has length 37 [2019-12-18 21:26:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:58,282 INFO L462 AbstractCegarLoop]: Abstraction has 46549 states and 177301 transitions. [2019-12-18 21:26:58,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:26:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46549 states and 177301 transitions. [2019-12-18 21:26:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:26:58,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:58,325 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] [2019-12-18 21:26:58,325 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:58,326 INFO L82 PathProgramCache]: Analyzing trace with hash -558902943, now seen corresponding path program 1 times [2019-12-18 21:26:58,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:58,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358114094] [2019-12-18 21:26:58,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:58,424 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-18 21:26:58,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358114094] [2019-12-18 21:26:58,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:58,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:26:58,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92818859] [2019-12-18 21:26:58,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:26:58,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:26:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:26:58,427 INFO L87 Difference]: Start difference. First operand 46549 states and 177301 transitions. Second operand 6 states. [2019-12-18 21:26:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:58,779 INFO L93 Difference]: Finished difference Result 69871 states and 261098 transitions. [2019-12-18 21:26:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:26:58,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 21:26:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:58,867 INFO L225 Difference]: With dead ends: 69871 [2019-12-18 21:26:58,867 INFO L226 Difference]: Without dead ends: 40625 [2019-12-18 21:26:58,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40625 states. [2019-12-18 21:27:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40625 to 40625. [2019-12-18 21:27:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40625 states. [2019-12-18 21:27:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40625 states to 40625 states and 153051 transitions. [2019-12-18 21:27:00,222 INFO L78 Accepts]: Start accepts. Automaton has 40625 states and 153051 transitions. Word has length 38 [2019-12-18 21:27:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:00,222 INFO L462 AbstractCegarLoop]: Abstraction has 40625 states and 153051 transitions. [2019-12-18 21:27:00,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 40625 states and 153051 transitions. [2019-12-18 21:27:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:27:00,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:00,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:00,257 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash 759415859, now seen corresponding path program 1 times [2019-12-18 21:27:00,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:00,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924789529] [2019-12-18 21:27:00,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:00,337 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-18 21:27:00,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924789529] [2019-12-18 21:27:00,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:00,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:27:00,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303884366] [2019-12-18 21:27:00,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:27:00,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:27:00,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:00,339 INFO L87 Difference]: Start difference. First operand 40625 states and 153051 transitions. Second operand 5 states. [2019-12-18 21:27:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:00,449 INFO L93 Difference]: Finished difference Result 15922 states and 50276 transitions. [2019-12-18 21:27:00,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:27:00,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-18 21:27:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:00,478 INFO L225 Difference]: With dead ends: 15922 [2019-12-18 21:27:00,479 INFO L226 Difference]: Without dead ends: 15116 [2019-12-18 21:27:00,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15116 states. [2019-12-18 21:27:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15116 to 15116. [2019-12-18 21:27:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15116 states. [2019-12-18 21:27:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15116 states to 15116 states and 47719 transitions. [2019-12-18 21:27:00,727 INFO L78 Accepts]: Start accepts. Automaton has 15116 states and 47719 transitions. Word has length 38 [2019-12-18 21:27:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 15116 states and 47719 transitions. [2019-12-18 21:27:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:27:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15116 states and 47719 transitions. [2019-12-18 21:27:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:27:00,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:00,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:00,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 384173619, now seen corresponding path program 1 times [2019-12-18 21:27:00,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:00,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056174036] [2019-12-18 21:27:00,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:00,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056174036] [2019-12-18 21:27:00,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:00,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:27:00,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771885832] [2019-12-18 21:27:00,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:27:00,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:27:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:00,854 INFO L87 Difference]: Start difference. First operand 15116 states and 47719 transitions. Second operand 7 states. [2019-12-18 21:27:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:01,278 INFO L93 Difference]: Finished difference Result 29063 states and 92339 transitions. [2019-12-18 21:27:01,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:27:01,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-18 21:27:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:01,305 INFO L225 Difference]: With dead ends: 29063 [2019-12-18 21:27:01,305 INFO L226 Difference]: Without dead ends: 17950 [2019-12-18 21:27:01,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:27:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17950 states. [2019-12-18 21:27:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17950 to 16725. [2019-12-18 21:27:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16725 states. [2019-12-18 21:27:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16725 states to 16725 states and 51415 transitions. [2019-12-18 21:27:01,576 INFO L78 Accepts]: Start accepts. Automaton has 16725 states and 51415 transitions. Word has length 39 [2019-12-18 21:27:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:01,577 INFO L462 AbstractCegarLoop]: Abstraction has 16725 states and 51415 transitions. [2019-12-18 21:27:01,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:27:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16725 states and 51415 transitions. [2019-12-18 21:27:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:27:01,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:01,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:01,592 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2023219185, now seen corresponding path program 2 times [2019-12-18 21:27:01,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:01,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169364215] [2019-12-18 21:27:01,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:01,742 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-18 21:27:01,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169364215] [2019-12-18 21:27:01,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:01,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:27:01,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777277039] [2019-12-18 21:27:01,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:27:01,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:27:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:27:01,745 INFO L87 Difference]: Start difference. First operand 16725 states and 51415 transitions. Second operand 10 states. [2019-12-18 21:27:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:02,314 INFO L93 Difference]: Finished difference Result 25677 states and 80383 transitions. [2019-12-18 21:27:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:27:02,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-12-18 21:27:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:02,346 INFO L225 Difference]: With dead ends: 25677 [2019-12-18 21:27:02,346 INFO L226 Difference]: Without dead ends: 22429 [2019-12-18 21:27:02,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:27:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22429 states. [2019-12-18 21:27:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22429 to 19495. [2019-12-18 21:27:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19495 states. [2019-12-18 21:27:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 60276 transitions. [2019-12-18 21:27:03,061 INFO L78 Accepts]: Start accepts. Automaton has 19495 states and 60276 transitions. Word has length 39 [2019-12-18 21:27:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:03,062 INFO L462 AbstractCegarLoop]: Abstraction has 19495 states and 60276 transitions. [2019-12-18 21:27:03,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:27:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19495 states and 60276 transitions. [2019-12-18 21:27:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:27:03,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:03,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:03,078 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2075840169, now seen corresponding path program 1 times [2019-12-18 21:27:03,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:03,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011618752] [2019-12-18 21:27:03,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:03,147 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-18 21:27:03,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011618752] [2019-12-18 21:27:03,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:03,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:03,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14961519] [2019-12-18 21:27:03,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:03,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:03,149 INFO L87 Difference]: Start difference. First operand 19495 states and 60276 transitions. Second operand 6 states. [2019-12-18 21:27:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:03,224 INFO L93 Difference]: Finished difference Result 3380 states and 8114 transitions. [2019-12-18 21:27:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:27:03,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 21:27:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:03,229 INFO L225 Difference]: With dead ends: 3380 [2019-12-18 21:27:03,229 INFO L226 Difference]: Without dead ends: 3049 [2019-12-18 21:27:03,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:27:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2019-12-18 21:27:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 3021. [2019-12-18 21:27:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2019-12-18 21:27:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 7178 transitions. [2019-12-18 21:27:03,268 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 7178 transitions. Word has length 40 [2019-12-18 21:27:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:03,268 INFO L462 AbstractCegarLoop]: Abstraction has 3021 states and 7178 transitions. [2019-12-18 21:27:03,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 7178 transitions. [2019-12-18 21:27:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:27:03,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:03,270 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] [2019-12-18 21:27:03,271 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 323536583, now seen corresponding path program 1 times [2019-12-18 21:27:03,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:03,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731093215] [2019-12-18 21:27:03,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:03,364 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-18 21:27:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731093215] [2019-12-18 21:27:03,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:03,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:27:03,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866611906] [2019-12-18 21:27:03,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:27:03,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:27:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:03,366 INFO L87 Difference]: Start difference. First operand 3021 states and 7178 transitions. Second operand 7 states. [2019-12-18 21:27:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:03,471 INFO L93 Difference]: Finished difference Result 1189 states and 3023 transitions. [2019-12-18 21:27:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:27:03,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 21:27:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:03,474 INFO L225 Difference]: With dead ends: 1189 [2019-12-18 21:27:03,474 INFO L226 Difference]: Without dead ends: 866 [2019-12-18 21:27:03,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-12-18 21:27:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 782. [2019-12-18 21:27:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 21:27:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1884 transitions. [2019-12-18 21:27:03,492 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1884 transitions. Word has length 48 [2019-12-18 21:27:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:03,493 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1884 transitions. [2019-12-18 21:27:03,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:27:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1884 transitions. [2019-12-18 21:27:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:27:03,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:03,495 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] [2019-12-18 21:27:03,496 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2083563203, now seen corresponding path program 1 times [2019-12-18 21:27:03,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:03,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142868091] [2019-12-18 21:27:03,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:03,620 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-18 21:27:03,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142868091] [2019-12-18 21:27:03,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:03,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:03,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619308931] [2019-12-18 21:27:03,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:03,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:03,623 INFO L87 Difference]: Start difference. First operand 782 states and 1884 transitions. Second operand 3 states. [2019-12-18 21:27:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:03,640 INFO L93 Difference]: Finished difference Result 748 states and 1760 transitions. [2019-12-18 21:27:03,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:03,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:27:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:03,642 INFO L225 Difference]: With dead ends: 748 [2019-12-18 21:27:03,642 INFO L226 Difference]: Without dead ends: 748 [2019-12-18 21:27:03,643 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-18 21:27:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-12-18 21:27:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-12-18 21:27:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 21:27:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1760 transitions. [2019-12-18 21:27:03,655 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1760 transitions. Word has length 59 [2019-12-18 21:27:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:03,655 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1760 transitions. [2019-12-18 21:27:03,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1760 transitions. [2019-12-18 21:27:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:03,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:03,657 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] [2019-12-18 21:27:03,658 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1577814574, now seen corresponding path program 1 times [2019-12-18 21:27:03,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:03,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825858817] [2019-12-18 21:27:03,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:03,819 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-18 21:27:03,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825858817] [2019-12-18 21:27:03,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:03,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:27:03,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129891458] [2019-12-18 21:27:03,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:27:03,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:27:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:03,825 INFO L87 Difference]: Start difference. First operand 748 states and 1760 transitions. Second operand 7 states. [2019-12-18 21:27:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:03,945 INFO L93 Difference]: Finished difference Result 1018 states and 2316 transitions. [2019-12-18 21:27:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:27:03,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 21:27:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:03,947 INFO L225 Difference]: With dead ends: 1018 [2019-12-18 21:27:03,947 INFO L226 Difference]: Without dead ends: 248 [2019-12-18 21:27:03,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-18 21:27:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-18 21:27:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-18 21:27:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 390 transitions. [2019-12-18 21:27:03,951 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 390 transitions. Word has length 60 [2019-12-18 21:27:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:03,952 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 390 transitions. [2019-12-18 21:27:03,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:27:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 390 transitions. [2019-12-18 21:27:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:03,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:03,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:03,953 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash -450753008, now seen corresponding path program 2 times [2019-12-18 21:27:03,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:03,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410479319] [2019-12-18 21:27:03,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:04,732 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-18 21:27:04,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410479319] [2019-12-18 21:27:04,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:04,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 21:27:04,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889511969] [2019-12-18 21:27:04,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 21:27:04,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 21:27:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:27:04,735 INFO L87 Difference]: Start difference. First operand 224 states and 390 transitions. Second operand 22 states. [2019-12-18 21:27:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:06,159 INFO L93 Difference]: Finished difference Result 539 states and 926 transitions. [2019-12-18 21:27:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 21:27:06,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-12-18 21:27:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:06,160 INFO L225 Difference]: With dead ends: 539 [2019-12-18 21:27:06,161 INFO L226 Difference]: Without dead ends: 504 [2019-12-18 21:27:06,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:27:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-18 21:27:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 292. [2019-12-18 21:27:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-18 21:27:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 503 transitions. [2019-12-18 21:27:06,165 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 503 transitions. Word has length 60 [2019-12-18 21:27:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:06,166 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 503 transitions. [2019-12-18 21:27:06,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 21:27:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 503 transitions. [2019-12-18 21:27:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:06,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:06,166 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] [2019-12-18 21:27:06,167 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2016155998, now seen corresponding path program 3 times [2019-12-18 21:27:06,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:06,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286590136] [2019-12-18 21:27:06,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286590136] [2019-12-18 21:27:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:06,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:27:06,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078425210] [2019-12-18 21:27:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:27:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:27:06,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:27:06,562 INFO L87 Difference]: Start difference. First operand 292 states and 503 transitions. Second operand 17 states. [2019-12-18 21:27:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:07,483 INFO L93 Difference]: Finished difference Result 513 states and 869 transitions. [2019-12-18 21:27:07,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:27:07,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-12-18 21:27:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:07,484 INFO L225 Difference]: With dead ends: 513 [2019-12-18 21:27:07,485 INFO L226 Difference]: Without dead ends: 478 [2019-12-18 21:27:07,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2019-12-18 21:27:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-18 21:27:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 322. [2019-12-18 21:27:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:27:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 562 transitions. [2019-12-18 21:27:07,491 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 562 transitions. Word has length 60 [2019-12-18 21:27:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:07,491 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 562 transitions. [2019-12-18 21:27:07,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:27:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 562 transitions. [2019-12-18 21:27:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:07,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:07,494 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] [2019-12-18 21:27:07,494 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1809244864, now seen corresponding path program 4 times [2019-12-18 21:27:07,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:07,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917901853] [2019-12-18 21:27:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:07,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-18 21:27:07,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917901853] [2019-12-18 21:27:07,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:07,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:27:07,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605235933] [2019-12-18 21:27:07,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:27:07,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:07,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:27:07,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:27:07,812 INFO L87 Difference]: Start difference. First operand 322 states and 562 transitions. Second operand 14 states. [2019-12-18 21:27:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:08,391 INFO L93 Difference]: Finished difference Result 469 states and 796 transitions. [2019-12-18 21:27:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:27:08,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:27:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:08,393 INFO L225 Difference]: With dead ends: 469 [2019-12-18 21:27:08,393 INFO L226 Difference]: Without dead ends: 434 [2019-12-18 21:27:08,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:27:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-18 21:27:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 320. [2019-12-18 21:27:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 21:27:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 554 transitions. [2019-12-18 21:27:08,399 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 554 transitions. Word has length 60 [2019-12-18 21:27:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:08,399 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 554 transitions. [2019-12-18 21:27:08,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:27:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 554 transitions. [2019-12-18 21:27:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:08,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:08,401 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] [2019-12-18 21:27:08,401 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1199767330, now seen corresponding path program 5 times [2019-12-18 21:27:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:08,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68118423] [2019-12-18 21:27:08,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:08,715 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-18 21:27:08,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68118423] [2019-12-18 21:27:08,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:08,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:27:08,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894378788] [2019-12-18 21:27:08,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:27:08,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:27:08,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:27:08,718 INFO L87 Difference]: Start difference. First operand 320 states and 554 transitions. Second operand 15 states. [2019-12-18 21:27:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:09,322 INFO L93 Difference]: Finished difference Result 441 states and 738 transitions. [2019-12-18 21:27:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:27:09,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:27:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:09,324 INFO L225 Difference]: With dead ends: 441 [2019-12-18 21:27:09,324 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 21:27:09,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:27:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 21:27:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 324. [2019-12-18 21:27:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-18 21:27:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 561 transitions. [2019-12-18 21:27:09,330 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 561 transitions. Word has length 60 [2019-12-18 21:27:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:09,331 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 561 transitions. [2019-12-18 21:27:09,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:27:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 561 transitions. [2019-12-18 21:27:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:09,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:09,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:09,332 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1921577050, now seen corresponding path program 6 times [2019-12-18 21:27:09,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:09,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526880191] [2019-12-18 21:27:09,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:09,624 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-18 21:27:09,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526880191] [2019-12-18 21:27:09,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:09,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:27:09,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738880597] [2019-12-18 21:27:09,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:27:09,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:27:09,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:27:09,629 INFO L87 Difference]: Start difference. First operand 324 states and 561 transitions. Second operand 13 states. [2019-12-18 21:27:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:09,906 INFO L93 Difference]: Finished difference Result 429 states and 717 transitions. [2019-12-18 21:27:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:27:09,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:27:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:09,907 INFO L225 Difference]: With dead ends: 429 [2019-12-18 21:27:09,907 INFO L226 Difference]: Without dead ends: 394 [2019-12-18 21:27:09,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:27:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-18 21:27:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 332. [2019-12-18 21:27:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 21:27:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 575 transitions. [2019-12-18 21:27:09,912 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 575 transitions. Word has length 60 [2019-12-18 21:27:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:09,912 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 575 transitions. [2019-12-18 21:27:09,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:27:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 575 transitions. [2019-12-18 21:27:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:27:09,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:09,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:27:09,914 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:27:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 790518800, now seen corresponding path program 7 times [2019-12-18 21:27:09,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:09,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979565408] [2019-12-18 21:27:09,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:27:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:27:10,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:27:10,106 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:27:10,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~z$w_buff1~0_23) (= v_~x~0_11 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~z$w_buff0_used~0_104 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~z$r_buff0_thd4~0_29 0) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~__unbuffered_p3_EAX~0_12) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed~0_5 0) (= 0 v_~z$r_buff1_thd0~0_50) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= 0 v_~z$flush_delayed~0_17) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 v_~z$w_buff1_used~0_64) (= v_~a~0_10 0) (= 0 v_~weak$$choice0~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$r_buff0_thd1~0_11 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~z$r_buff0_thd2~0_9 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= v_~z$mem_tmp~0_12 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$r_buff0_thd3~0_22 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_64, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_10|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_8|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_6|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_6|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_5|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1150~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1151~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:27:10,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-18 21:27:10,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:27:10,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-18 21:27:10,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L812: Formula: (and (= ~z$r_buff1_thd0~0_Out-1800808056 ~z$r_buff0_thd0~0_In-1800808056) (= ~z$r_buff1_thd3~0_Out-1800808056 ~z$r_buff0_thd3~0_In-1800808056) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1800808056 0)) (= ~z$r_buff1_thd2~0_Out-1800808056 ~z$r_buff0_thd2~0_In-1800808056) (= 1 ~a~0_Out-1800808056) (= ~z$r_buff1_thd4~0_Out-1800808056 ~z$r_buff0_thd4~0_In-1800808056) (= 1 ~z$r_buff0_thd4~0_Out-1800808056) (= ~z$r_buff0_thd1~0_In-1800808056 ~z$r_buff1_thd1~0_Out-1800808056) (= ~b~0_In-1800808056 ~__unbuffered_p3_EBX~0_Out-1800808056) (= ~__unbuffered_p3_EAX~0_Out-1800808056 ~a~0_Out-1800808056)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1800808056, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1800808056, ~b~0=~b~0_In-1800808056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1800808056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1800808056, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1800808056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1800808056} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1800808056, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1800808056, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1800808056, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1800808056, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1800808056, ~a~0=~a~0_Out-1800808056, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1800808056, ~b~0=~b~0_In-1800808056, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1800808056, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1800808056, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1800808056, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1800808056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1800808056, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1800808056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1800808056} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:27:10,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_7} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:27:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 1 v_~x~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_5, ~x~0=v_~x~0_5, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:27:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1183233790 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1183233790 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1183233790| ~z$w_buff0_used~0_In-1183233790) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1183233790| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183233790, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1183233790} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183233790, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1183233790, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1183233790|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:27:10,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1004003768 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1004003768 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1004003768 |P2Thread1of1ForFork2_#t~ite3_Out1004003768|)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out1004003768| ~z$w_buff1~0_In1004003768) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1004003768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1004003768, ~z$w_buff1~0=~z$w_buff1~0_In1004003768, ~z~0=~z~0_In1004003768} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1004003768|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1004003768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1004003768, ~z$w_buff1~0=~z$w_buff1~0_In1004003768, ~z~0=~z~0_In1004003768} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:27:10,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_15 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:27:10,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1457919378 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1457919378 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1457919378| 0)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1457919378| ~z$w_buff0_used~0_In-1457919378) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457919378, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1457919378} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1457919378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457919378, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1457919378} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:27:10,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In452083013 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In452083013 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In452083013 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In452083013 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out452083013| ~z$w_buff1_used~0_In452083013)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite6_Out452083013| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In452083013, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452083013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452083013, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In452083013} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out452083013|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In452083013, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In452083013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452083013, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In452083013} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:27:10,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1921366509 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1921366509 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out1921366509| ~z$r_buff0_thd3~0_In1921366509) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1921366509| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1921366509, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1921366509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1921366509, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1921366509, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1921366509|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:27:10,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In195949239 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In195949239 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In195949239 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In195949239 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out195949239| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In195949239 |P2Thread1of1ForFork2_#t~ite8_Out195949239|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In195949239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In195949239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195949239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In195949239} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In195949239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In195949239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In195949239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In195949239, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out195949239|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:27:10,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:27:10,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In370326194 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In370326194 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In370326194 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In370326194 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out370326194|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In370326194 |P3Thread1of1ForFork3_#t~ite12_Out370326194|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In370326194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In370326194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In370326194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In370326194} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In370326194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In370326194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In370326194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In370326194, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out370326194|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:27:10,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1243335670 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1243335670 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1243335670 ~z$r_buff0_thd4~0_In1243335670) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd4~0_Out1243335670 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1243335670, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1243335670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1243335670, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1243335670, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1243335670|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:27:10,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-257288042 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-257288042 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-257288042 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-257288042 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out-257288042| ~z$r_buff1_thd4~0_In-257288042) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-257288042|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-257288042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-257288042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-257288042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-257288042} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-257288042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-257288042, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-257288042|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-257288042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-257288042} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:27:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:27:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_47 256) 0) (= (mod v_~z$w_buff0_used~0_70 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:27:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out961819407| |ULTIMATE.start_main_#t~ite20_Out961819407|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In961819407 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In961819407 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In961819407 |ULTIMATE.start_main_#t~ite19_Out961819407|) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite19_Out961819407| ~z~0_In961819407) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961819407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961819407, ~z$w_buff1~0=~z$w_buff1~0_In961819407, ~z~0=~z~0_In961819407} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out961819407|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961819407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961819407, ~z$w_buff1~0=~z$w_buff1~0_In961819407, ~z~0=~z~0_In961819407, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out961819407|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:27:10,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2101739129 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2101739129 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-2101739129| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out-2101739129| ~z$w_buff0_used~0_In-2101739129) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2101739129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2101739129} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2101739129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2101739129, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2101739129|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:27:10,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In488524030 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In488524030 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In488524030 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In488524030 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out488524030|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In488524030 |ULTIMATE.start_main_#t~ite22_Out488524030|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In488524030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In488524030, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In488524030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488524030} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In488524030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In488524030, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In488524030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488524030, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out488524030|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:27:10,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1563665377 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1563665377 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1563665377| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1563665377 |ULTIMATE.start_main_#t~ite23_Out-1563665377|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1563665377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1563665377} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1563665377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1563665377, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1563665377|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:27:10,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1664023132 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1664023132 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1664023132 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1664023132 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1664023132 |ULTIMATE.start_main_#t~ite24_Out-1664023132|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1664023132|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1664023132, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664023132, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1664023132, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1664023132} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1664023132, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664023132, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1664023132, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1664023132|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1664023132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:27:10,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1133326660 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_In-1133326660| |ULTIMATE.start_main_#t~ite36_Out-1133326660|) (= ~z$w_buff0_used~0_In-1133326660 |ULTIMATE.start_main_#t~ite37_Out-1133326660|) (not .cse0)) (and (= ~z$w_buff0_used~0_In-1133326660 |ULTIMATE.start_main_#t~ite36_Out-1133326660|) (= |ULTIMATE.start_main_#t~ite37_Out-1133326660| |ULTIMATE.start_main_#t~ite36_Out-1133326660|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1133326660 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-1133326660 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-1133326660 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1133326660 256)))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1133326660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1133326660, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1133326660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1133326660, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1133326660|, ~weak$$choice2~0=~weak$$choice2~0_In-1133326660} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1133326660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1133326660, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1133326660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1133326660, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1133326660|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1133326660|, ~weak$$choice2~0=~weak$$choice2~0_In-1133326660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:27:10,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L862-->L862-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1371129176 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1371129176 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1371129176 256))) (= (mod ~z$w_buff0_used~0_In1371129176 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1371129176 256))))) (= |ULTIMATE.start_main_#t~ite39_Out1371129176| |ULTIMATE.start_main_#t~ite40_Out1371129176|) .cse1 (= |ULTIMATE.start_main_#t~ite39_Out1371129176| ~z$w_buff1_used~0_In1371129176)) (and (= ~z$w_buff1_used~0_In1371129176 |ULTIMATE.start_main_#t~ite40_Out1371129176|) (= |ULTIMATE.start_main_#t~ite39_In1371129176| |ULTIMATE.start_main_#t~ite39_Out1371129176|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1371129176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1371129176, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1371129176|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1371129176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371129176, ~weak$$choice2~0=~weak$$choice2~0_In1371129176} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1371129176, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1371129176|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1371129176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1371129176, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1371129176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1371129176, ~weak$$choice2~0=~weak$$choice2~0_In1371129176} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:27:10,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (= v_~z$r_buff0_thd0~0_58 v_~z$r_buff0_thd0~0_57) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_57, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:27:10,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~z~0_21 v_~z$mem_tmp~0_7) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:27:10,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:27:10,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:27:10 BasicIcfg [2019-12-18 21:27:10,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:27:10,264 INFO L168 Benchmark]: Toolchain (without parser) took 65080.03 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,264 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.18 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,266 INFO L168 Benchmark]: Boogie Preprocessor took 44.80 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,266 INFO L168 Benchmark]: RCFGBuilder took 796.85 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 99.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,267 INFO L168 Benchmark]: TraceAbstraction took 63399.55 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 21:27:10,269 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.65 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.18 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.80 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.85 ms. Allocated memory is still 201.3 MB. Free memory was 148.9 MB in the beginning and 99.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63399.55 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 182 ProgramPointsBefore, 91 ProgramPointsAfterwards, 210 TransitionsBefore, 98 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 4581 VarBasedMoverChecksPositive, 178 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 57720 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] 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) [L859] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L859] 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)) [L860] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L860] 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)) [L861] 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)) [L862] 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)) [L864] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 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)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.0s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3232 SDtfs, 4170 SDslu, 10406 SDs, 0 SdLazy, 5021 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66690occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 87601 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 899 ConstructedInterpolants, 0 QuantifiedInterpolants, 273259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...