/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_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:26:36,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:26:36,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:26:36,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:26:36,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:26:36,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:26:36,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:26:36,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:26:36,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:26:36,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:26:36,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:26:36,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:26:36,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:26:36,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:26:36,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:26:36,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:26:36,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:26:36,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:26:36,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:26:36,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:26:36,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:26:36,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:26:36,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:26:36,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:26:36,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:26:36,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:26:36,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:26:36,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:26:36,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:26:36,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:26:36,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:26:36,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:26:36,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:26:36,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:26:36,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:26:36,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:26:36,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:26:36,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:26:36,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:26:36,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:26:36,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:26:36,756 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:36,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:26:36,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:26:36,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:26:36,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:26:36,772 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:26:36,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:26:36,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:26:36,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:26:36,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:26:36,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:26:36,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:26:36,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:26:36,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:26:36,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:26:36,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:26:36,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:26:36,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:26:36,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:26:36,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:26:36,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:26:36,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:26:36,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:26:36,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:26:36,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:26:36,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:26:36,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:26:36,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:26:36,776 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:26:36,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:26:36,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:26:37,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:26:37,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:26:37,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:26:37,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:26:37,080 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:26:37,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-18 21:26:37,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe072708/65c41ffbaa6e478fb8e13a469356c0aa/FLAG737a0901b [2019-12-18 21:26:37,747 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:26:37,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-18 21:26:37,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe072708/65c41ffbaa6e478fb8e13a469356c0aa/FLAG737a0901b [2019-12-18 21:26:37,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe072708/65c41ffbaa6e478fb8e13a469356c0aa [2019-12-18 21:26:37,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:26:37,992 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:26:37,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:26:37,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:26:37,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:26:37,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:26:37" (1/1) ... [2019-12-18 21:26:38,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:37, skipping insertion in model container [2019-12-18 21:26:38,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:26:37" (1/1) ... [2019-12-18 21:26:38,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:26:38,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:26:38,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:26:38,617 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:26:38,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:26:38,816 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:26:38,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:38 WrapperNode [2019-12-18 21:26:38,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:26:38,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:26:38,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:26:38,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:26:38,827 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:38" (1/1) ... [2019-12-18 21:26:38,848 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:38" (1/1) ... [2019-12-18 21:26:38,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:26:38,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:26:38,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:26:38,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:26:38,900 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:38" (1/1) ... [2019-12-18 21:26:38,900 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:38" (1/1) ... [2019-12-18 21:26:38,906 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:38" (1/1) ... [2019-12-18 21:26:38,906 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:38" (1/1) ... [2019-12-18 21:26:38,916 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:38" (1/1) ... [2019-12-18 21:26:38,920 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:38" (1/1) ... [2019-12-18 21:26:38,924 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:38" (1/1) ... [2019-12-18 21:26:38,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:26:38,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:26:38,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:26:38,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:26:38,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:38" (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:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:26:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:26:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:26:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:26:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:26:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:26:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:26:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:26:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:26:39,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:26:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:26:39,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:26:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:26:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:26:39,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:26:39,007 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:26:39,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:26:39,842 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:26:39,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:26:39 BoogieIcfgContainer [2019-12-18 21:26:39,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:26:39,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:26:39,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:26:39,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:26:39,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:26:37" (1/3) ... [2019-12-18 21:26:39,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abac521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:26:39, skipping insertion in model container [2019-12-18 21:26:39,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:26:38" (2/3) ... [2019-12-18 21:26:39,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abac521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:26:39, skipping insertion in model container [2019-12-18 21:26:39,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:26:39" (3/3) ... [2019-12-18 21:26:39,852 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2019-12-18 21:26:39,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:26:39,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:26:39,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:26:39,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:26:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,923 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,924 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,924 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,924 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:39,925 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,925 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,961 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,964 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,964 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,966 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:39,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,966 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:26:39,982 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:26:40,003 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:26:40,003 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:26:40,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:26:40,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:26:40,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:26:40,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:26:40,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:26:40,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:26:40,020 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 21:26:40,022 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:26:40,136 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:26:40,137 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:26:40,157 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:40,177 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:26:40,258 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:26:40,258 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:26:40,268 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:40,287 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:26:40,288 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:26:43,916 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 21:26:44,070 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 21:26:44,100 INFO L206 etLargeBlockEncoding]: Checked pairs total: 57720 [2019-12-18 21:26:44,100 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 21:26:44,104 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 98 transitions [2019-12-18 21:26:46,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:26:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:26:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:26:46,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:46,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:46,448 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:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash 86209296, now seen corresponding path program 1 times [2019-12-18 21:26:46,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:46,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737347386] [2019-12-18 21:26:46,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:46,803 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:46,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737347386] [2019-12-18 21:26:46,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:46,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:26:46,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215608360] [2019-12-18 21:26:46,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:46,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:46,831 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:26:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:48,267 INFO L93 Difference]: Finished difference Result 34422 states and 146848 transitions. [2019-12-18 21:26:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:48,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:26:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:48,640 INFO L225 Difference]: With dead ends: 34422 [2019-12-18 21:26:48,643 INFO L226 Difference]: Without dead ends: 33750 [2019-12-18 21:26:48,644 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:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33750 states. [2019-12-18 21:26:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33750 to 33750. [2019-12-18 21:26:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33750 states. [2019-12-18 21:26:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33750 states to 33750 states and 144104 transitions. [2019-12-18 21:26:50,446 INFO L78 Accepts]: Start accepts. Automaton has 33750 states and 144104 transitions. Word has length 9 [2019-12-18 21:26:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:50,447 INFO L462 AbstractCegarLoop]: Abstraction has 33750 states and 144104 transitions. [2019-12-18 21:26:50,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 33750 states and 144104 transitions. [2019-12-18 21:26:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:26:50,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:50,455 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:50,455 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:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2020718279, now seen corresponding path program 1 times [2019-12-18 21:26:50,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:50,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115486768] [2019-12-18 21:26:50,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:50,553 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:50,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115486768] [2019-12-18 21:26:50,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:50,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:50,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813584989] [2019-12-18 21:26:50,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:50,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:50,556 INFO L87 Difference]: Start difference. First operand 33750 states and 144104 transitions. Second operand 4 states. [2019-12-18 21:26:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:52,957 INFO L93 Difference]: Finished difference Result 52526 states and 216740 transitions. [2019-12-18 21:26:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:26:52,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:26:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:53,259 INFO L225 Difference]: With dead ends: 52526 [2019-12-18 21:26:53,259 INFO L226 Difference]: Without dead ends: 52498 [2019-12-18 21:26:53,260 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:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52498 states. [2019-12-18 21:26:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52498 to 47958. [2019-12-18 21:26:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47958 states. [2019-12-18 21:26:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47958 states to 47958 states and 199860 transitions. [2019-12-18 21:26:55,509 INFO L78 Accepts]: Start accepts. Automaton has 47958 states and 199860 transitions. Word has length 15 [2019-12-18 21:26:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:55,510 INFO L462 AbstractCegarLoop]: Abstraction has 47958 states and 199860 transitions. [2019-12-18 21:26:55,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:26:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47958 states and 199860 transitions. [2019-12-18 21:26:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:26:55,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:55,514 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:55,514 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:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1977980563, now seen corresponding path program 1 times [2019-12-18 21:26:55,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:55,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339538807] [2019-12-18 21:26:55,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:55,577 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:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339538807] [2019-12-18 21:26:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:55,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:55,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399010399] [2019-12-18 21:26:55,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:55,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:55,579 INFO L87 Difference]: Start difference. First operand 47958 states and 199860 transitions. Second operand 4 states. [2019-12-18 21:26:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:56,034 INFO L93 Difference]: Finished difference Result 59070 states and 244072 transitions. [2019-12-18 21:26:56,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:26:56,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:26:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:56,441 INFO L225 Difference]: With dead ends: 59070 [2019-12-18 21:26:56,442 INFO L226 Difference]: Without dead ends: 59070 [2019-12-18 21:26:56,442 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:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59070 states. [2019-12-18 21:27:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59070 to 53006. [2019-12-18 21:27:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53006 states. [2019-12-18 21:27:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53006 states to 53006 states and 220392 transitions. [2019-12-18 21:27:00,430 INFO L78 Accepts]: Start accepts. Automaton has 53006 states and 220392 transitions. Word has length 15 [2019-12-18 21:27:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:00,430 INFO L462 AbstractCegarLoop]: Abstraction has 53006 states and 220392 transitions. [2019-12-18 21:27:00,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:27:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 53006 states and 220392 transitions. [2019-12-18 21:27:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:27:00,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:00,444 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:27:00,445 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:27:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -587282460, now seen corresponding path program 1 times [2019-12-18 21:27:00,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:00,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857442466] [2019-12-18 21:27:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:27:00,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857442466] [2019-12-18 21:27:00,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:00,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:27:00,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798942185] [2019-12-18 21:27:00,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:27:00,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:27:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:27:00,536 INFO L87 Difference]: Start difference. First operand 53006 states and 220392 transitions. Second operand 5 states. [2019-12-18 21:27:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:01,795 INFO L93 Difference]: Finished difference Result 70534 states and 288484 transitions. [2019-12-18 21:27:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:27:01,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:27:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:02,016 INFO L225 Difference]: With dead ends: 70534 [2019-12-18 21:27:02,017 INFO L226 Difference]: Without dead ends: 70506 [2019-12-18 21:27:02,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 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:27:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70506 states. [2019-12-18 21:27:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70506 to 52682. [2019-12-18 21:27:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52682 states. [2019-12-18 21:27:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52682 states to 52682 states and 218712 transitions. [2019-12-18 21:27:05,825 INFO L78 Accepts]: Start accepts. Automaton has 52682 states and 218712 transitions. Word has length 21 [2019-12-18 21:27:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:05,826 INFO L462 AbstractCegarLoop]: Abstraction has 52682 states and 218712 transitions. [2019-12-18 21:27:05,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:27:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 52682 states and 218712 transitions. [2019-12-18 21:27:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:27:05,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:05,865 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:27:05,865 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:27:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:05,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1693897678, now seen corresponding path program 1 times [2019-12-18 21:27:05,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:05,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950794040] [2019-12-18 21:27:05,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:05,924 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:05,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950794040] [2019-12-18 21:27:05,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:27:05,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596681087] [2019-12-18 21:27:05,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:05,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:05,926 INFO L87 Difference]: Start difference. First operand 52682 states and 218712 transitions. Second operand 3 states. [2019-12-18 21:27:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:06,686 INFO L93 Difference]: Finished difference Result 65362 states and 268648 transitions. [2019-12-18 21:27:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:06,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 21:27:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:06,898 INFO L225 Difference]: With dead ends: 65362 [2019-12-18 21:27:06,898 INFO L226 Difference]: Without dead ends: 65362 [2019-12-18 21:27:06,898 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:27:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65362 states. [2019-12-18 21:27:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65362 to 57878. [2019-12-18 21:27:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57878 states. [2019-12-18 21:27:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57878 states to 57878 states and 239624 transitions. [2019-12-18 21:27:10,657 INFO L78 Accepts]: Start accepts. Automaton has 57878 states and 239624 transitions. Word has length 29 [2019-12-18 21:27:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:10,658 INFO L462 AbstractCegarLoop]: Abstraction has 57878 states and 239624 transitions. [2019-12-18 21:27:10,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57878 states and 239624 transitions. [2019-12-18 21:27:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:27:10,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:10,691 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:27:10,691 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:27:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1910359084, now seen corresponding path program 1 times [2019-12-18 21:27:10,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:10,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101076061] [2019-12-18 21:27:10,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:10,788 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:10,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101076061] [2019-12-18 21:27:10,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:10,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:27:10,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998541144] [2019-12-18 21:27:10,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:10,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:10,790 INFO L87 Difference]: Start difference. First operand 57878 states and 239624 transitions. Second operand 6 states. [2019-12-18 21:27:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:12,048 INFO L93 Difference]: Finished difference Result 82714 states and 336740 transitions. [2019-12-18 21:27:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:27:12,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:27:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:12,267 INFO L225 Difference]: With dead ends: 82714 [2019-12-18 21:27:12,267 INFO L226 Difference]: Without dead ends: 82650 [2019-12-18 21:27:12,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:27:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82650 states. [2019-12-18 21:27:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82650 to 66690. [2019-12-18 21:27:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66690 states. [2019-12-18 21:27:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66690 states to 66690 states and 274804 transitions. [2019-12-18 21:27:14,394 INFO L78 Accepts]: Start accepts. Automaton has 66690 states and 274804 transitions. Word has length 29 [2019-12-18 21:27:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:14,395 INFO L462 AbstractCegarLoop]: Abstraction has 66690 states and 274804 transitions. [2019-12-18 21:27:14,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 66690 states and 274804 transitions. [2019-12-18 21:27:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:27:14,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:14,465 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:27:14,466 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:27:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1476951563, now seen corresponding path program 1 times [2019-12-18 21:27:14,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:14,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917030242] [2019-12-18 21:27:14,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:14,585 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:14,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917030242] [2019-12-18 21:27:14,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:14,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:27:14,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386743106] [2019-12-18 21:27:14,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:27:14,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:27:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:27:14,587 INFO L87 Difference]: Start difference. First operand 66690 states and 274804 transitions. Second operand 7 states. [2019-12-18 21:27:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:18,148 INFO L93 Difference]: Finished difference Result 90854 states and 367944 transitions. [2019-12-18 21:27:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:27:18,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 21:27:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:18,389 INFO L225 Difference]: With dead ends: 90854 [2019-12-18 21:27:18,389 INFO L226 Difference]: Without dead ends: 90750 [2019-12-18 21:27:18,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 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:27:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90750 states. [2019-12-18 21:27:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90750 to 59942. [2019-12-18 21:27:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59942 states. [2019-12-18 21:27:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59942 states to 59942 states and 248164 transitions. [2019-12-18 21:27:20,227 INFO L78 Accepts]: Start accepts. Automaton has 59942 states and 248164 transitions. Word has length 35 [2019-12-18 21:27:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:20,228 INFO L462 AbstractCegarLoop]: Abstraction has 59942 states and 248164 transitions. [2019-12-18 21:27:20,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:27:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59942 states and 248164 transitions. [2019-12-18 21:27:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:27:20,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:20,283 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:27:20,284 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:27:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -29640414, now seen corresponding path program 1 times [2019-12-18 21:27:20,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:20,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50201299] [2019-12-18 21:27:20,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:20,449 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:20,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50201299] [2019-12-18 21:27:20,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:20,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:27:20,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509349763] [2019-12-18 21:27:20,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:27:20,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:27:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:27:20,451 INFO L87 Difference]: Start difference. First operand 59942 states and 248164 transitions. Second operand 6 states. [2019-12-18 21:27:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:21,819 INFO L93 Difference]: Finished difference Result 75726 states and 316164 transitions. [2019-12-18 21:27:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:27:21,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 21:27:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:22,008 INFO L225 Difference]: With dead ends: 75726 [2019-12-18 21:27:22,008 INFO L226 Difference]: Without dead ends: 72346 [2019-12-18 21:27:22,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72346 states. [2019-12-18 21:27:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72346 to 67210. [2019-12-18 21:27:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67210 states. [2019-12-18 21:27:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67210 states to 67210 states and 280104 transitions. [2019-12-18 21:27:27,026 INFO L78 Accepts]: Start accepts. Automaton has 67210 states and 280104 transitions. Word has length 35 [2019-12-18 21:27:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:27,027 INFO L462 AbstractCegarLoop]: Abstraction has 67210 states and 280104 transitions. [2019-12-18 21:27:27,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:27:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 67210 states and 280104 transitions. [2019-12-18 21:27:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 21:27:27,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:27,115 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:27:27,115 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:27:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1282093875, now seen corresponding path program 1 times [2019-12-18 21:27:27,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:27,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023385463] [2019-12-18 21:27:27,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:27,190 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:27,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023385463] [2019-12-18 21:27:27,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:27,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:27:27,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532316120] [2019-12-18 21:27:27,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:27:27,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:27:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:27:27,192 INFO L87 Difference]: Start difference. First operand 67210 states and 280104 transitions. Second operand 3 states. [2019-12-18 21:27:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:27,543 INFO L93 Difference]: Finished difference Result 67210 states and 279384 transitions. [2019-12-18 21:27:27,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:27:27,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 21:27:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:27,712 INFO L225 Difference]: With dead ends: 67210 [2019-12-18 21:27:27,712 INFO L226 Difference]: Without dead ends: 67210 [2019-12-18 21:27:27,712 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:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67210 states. [2019-12-18 21:27:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67210 to 67210. [2019-12-18 21:27:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67210 states. [2019-12-18 21:27:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67210 states to 67210 states and 279384 transitions. [2019-12-18 21:27:29,549 INFO L78 Accepts]: Start accepts. Automaton has 67210 states and 279384 transitions. Word has length 36 [2019-12-18 21:27:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:29,549 INFO L462 AbstractCegarLoop]: Abstraction has 67210 states and 279384 transitions. [2019-12-18 21:27:29,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:27:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 67210 states and 279384 transitions. [2019-12-18 21:27:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:27:29,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:29,616 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:27:29,616 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:27:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:29,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2137371719, now seen corresponding path program 1 times [2019-12-18 21:27:29,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:29,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347092117] [2019-12-18 21:27:29,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:29,868 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:29,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347092117] [2019-12-18 21:27:29,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:29,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:27:29,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387262732] [2019-12-18 21:27:29,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:27:29,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:27:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:27:29,871 INFO L87 Difference]: Start difference. First operand 67210 states and 279384 transitions. Second operand 10 states. [2019-12-18 21:27:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:32,221 INFO L93 Difference]: Finished difference Result 125757 states and 524228 transitions. [2019-12-18 21:27:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:27:32,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 21:27:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:32,517 INFO L225 Difference]: With dead ends: 125757 [2019-12-18 21:27:32,517 INFO L226 Difference]: Without dead ends: 106543 [2019-12-18 21:27:32,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:27:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106543 states. [2019-12-18 21:27:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106543 to 94869. [2019-12-18 21:27:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94869 states. [2019-12-18 21:27:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94869 states to 94869 states and 397259 transitions. [2019-12-18 21:27:38,264 INFO L78 Accepts]: Start accepts. Automaton has 94869 states and 397259 transitions. Word has length 37 [2019-12-18 21:27:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:38,264 INFO L462 AbstractCegarLoop]: Abstraction has 94869 states and 397259 transitions. [2019-12-18 21:27:38,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:27:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 94869 states and 397259 transitions. [2019-12-18 21:27:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:27:38,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:38,394 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:38,394 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:27:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 253483219, now seen corresponding path program 1 times [2019-12-18 21:27:38,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:38,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528944476] [2019-12-18 21:27:38,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:38,641 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:38,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528944476] [2019-12-18 21:27:38,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:38,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:27:38,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419309149] [2019-12-18 21:27:38,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:27:38,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:27:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:27:38,644 INFO L87 Difference]: Start difference. First operand 94869 states and 397259 transitions. Second operand 11 states. [2019-12-18 21:27:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:41,042 INFO L93 Difference]: Finished difference Result 146180 states and 610506 transitions. [2019-12-18 21:27:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:27:41,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-18 21:27:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:41,426 INFO L225 Difference]: With dead ends: 146180 [2019-12-18 21:27:41,426 INFO L226 Difference]: Without dead ends: 127916 [2019-12-18 21:27:41,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:27:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127916 states. [2019-12-18 21:27:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127916 to 90802. [2019-12-18 21:27:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90802 states. [2019-12-18 21:27:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90802 states to 90802 states and 376776 transitions. [2019-12-18 21:27:48,701 INFO L78 Accepts]: Start accepts. Automaton has 90802 states and 376776 transitions. Word has length 38 [2019-12-18 21:27:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:48,701 INFO L462 AbstractCegarLoop]: Abstraction has 90802 states and 376776 transitions. [2019-12-18 21:27:48,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:27:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 90802 states and 376776 transitions. [2019-12-18 21:27:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:27:48,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:48,823 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:48,823 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:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1019177435, now seen corresponding path program 2 times [2019-12-18 21:27:48,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:48,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746040905] [2019-12-18 21:27:48,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:48,950 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:48,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746040905] [2019-12-18 21:27:48,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:48,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:27:48,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174782976] [2019-12-18 21:27:48,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:27:48,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:27:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:27:48,952 INFO L87 Difference]: Start difference. First operand 90802 states and 376776 transitions. Second operand 9 states. [2019-12-18 21:27:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:27:50,105 INFO L93 Difference]: Finished difference Result 166714 states and 693676 transitions. [2019-12-18 21:27:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:27:50,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-18 21:27:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:27:50,537 INFO L225 Difference]: With dead ends: 166714 [2019-12-18 21:27:50,537 INFO L226 Difference]: Without dead ends: 146730 [2019-12-18 21:27:50,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:27:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146730 states. [2019-12-18 21:27:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146730 to 90166. [2019-12-18 21:27:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90166 states. [2019-12-18 21:27:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90166 states to 90166 states and 373452 transitions. [2019-12-18 21:27:53,924 INFO L78 Accepts]: Start accepts. Automaton has 90166 states and 373452 transitions. Word has length 38 [2019-12-18 21:27:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:27:53,924 INFO L462 AbstractCegarLoop]: Abstraction has 90166 states and 373452 transitions. [2019-12-18 21:27:53,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:27:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 90166 states and 373452 transitions. [2019-12-18 21:27:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:27:58,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:27:58,331 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:58,331 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:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:27:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1000547259, now seen corresponding path program 3 times [2019-12-18 21:27:58,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:27:58,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338920305] [2019-12-18 21:27:58,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:27:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:27:58,599 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:58,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338920305] [2019-12-18 21:27:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:27:58,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:27:58,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678579179] [2019-12-18 21:27:58,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:27:58,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:27:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:27:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:27:58,602 INFO L87 Difference]: Start difference. First operand 90166 states and 373452 transitions. Second operand 12 states. [2019-12-18 21:28:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:00,555 INFO L93 Difference]: Finished difference Result 151450 states and 631300 transitions. [2019-12-18 21:28:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:28:00,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-12-18 21:28:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:00,961 INFO L225 Difference]: With dead ends: 151450 [2019-12-18 21:28:00,961 INFO L226 Difference]: Without dead ends: 139182 [2019-12-18 21:28:00,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:28:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139182 states. [2019-12-18 21:28:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139182 to 90166. [2019-12-18 21:28:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90166 states. [2019-12-18 21:28:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90166 states to 90166 states and 373404 transitions. [2019-12-18 21:28:03,929 INFO L78 Accepts]: Start accepts. Automaton has 90166 states and 373404 transitions. Word has length 38 [2019-12-18 21:28:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:03,930 INFO L462 AbstractCegarLoop]: Abstraction has 90166 states and 373404 transitions. [2019-12-18 21:28:03,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:28:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90166 states and 373404 transitions. [2019-12-18 21:28:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:28:04,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:04,057 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:28:04,057 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:28:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash -86186748, now seen corresponding path program 1 times [2019-12-18 21:28:04,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:04,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128046240] [2019-12-18 21:28:04,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:04,215 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:28:04,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128046240] [2019-12-18 21:28:04,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:04,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:04,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388967455] [2019-12-18 21:28:04,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:28:04,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:28:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:28:04,218 INFO L87 Difference]: Start difference. First operand 90166 states and 373404 transitions. Second operand 7 states. [2019-12-18 21:28:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:06,273 INFO L93 Difference]: Finished difference Result 130270 states and 535436 transitions. [2019-12-18 21:28:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:28:06,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 21:28:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:06,647 INFO L225 Difference]: With dead ends: 130270 [2019-12-18 21:28:06,647 INFO L226 Difference]: Without dead ends: 129694 [2019-12-18 21:28:06,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:28:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129694 states. [2019-12-18 21:28:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129694 to 112094. [2019-12-18 21:28:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112094 states. [2019-12-18 21:28:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112094 states to 112094 states and 463612 transitions. [2019-12-18 21:28:10,065 INFO L78 Accepts]: Start accepts. Automaton has 112094 states and 463612 transitions. Word has length 38 [2019-12-18 21:28:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:10,065 INFO L462 AbstractCegarLoop]: Abstraction has 112094 states and 463612 transitions. [2019-12-18 21:28:10,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:28:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 112094 states and 463612 transitions. [2019-12-18 21:28:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:28:10,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:10,228 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:28:10,228 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:28:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1863269316, now seen corresponding path program 2 times [2019-12-18 21:28:10,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:10,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059728219] [2019-12-18 21:28:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:10,295 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:28:10,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059728219] [2019-12-18 21:28:10,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:10,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:28:10,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86449300] [2019-12-18 21:28:10,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:28:10,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:28:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:28:10,298 INFO L87 Difference]: Start difference. First operand 112094 states and 463612 transitions. Second operand 4 states. [2019-12-18 21:28:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:10,778 INFO L93 Difference]: Finished difference Result 87611 states and 333296 transitions. [2019-12-18 21:28:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:28:10,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-18 21:28:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:12,008 INFO L225 Difference]: With dead ends: 87611 [2019-12-18 21:28:12,009 INFO L226 Difference]: Without dead ends: 86375 [2019-12-18 21:28:12,009 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:28:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86375 states. [2019-12-18 21:28:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86375 to 86375. [2019-12-18 21:28:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86375 states. [2019-12-18 21:28:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86375 states to 86375 states and 329380 transitions. [2019-12-18 21:28:14,823 INFO L78 Accepts]: Start accepts. Automaton has 86375 states and 329380 transitions. Word has length 38 [2019-12-18 21:28:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:14,823 INFO L462 AbstractCegarLoop]: Abstraction has 86375 states and 329380 transitions. [2019-12-18 21:28:14,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:28:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86375 states and 329380 transitions. [2019-12-18 21:28:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:28:14,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:14,935 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:28:14,935 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:28:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash -743806180, now seen corresponding path program 1 times [2019-12-18 21:28:14,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:14,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727084435] [2019-12-18 21:28:14,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:15,051 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:28:15,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727084435] [2019-12-18 21:28:15,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:15,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:15,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315788014] [2019-12-18 21:28:15,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:28:15,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:28:15,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:28:15,054 INFO L87 Difference]: Start difference. First operand 86375 states and 329380 transitions. Second operand 7 states. [2019-12-18 21:28:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:15,850 INFO L93 Difference]: Finished difference Result 137568 states and 514515 transitions. [2019-12-18 21:28:15,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:28:15,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-18 21:28:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:16,039 INFO L225 Difference]: With dead ends: 137568 [2019-12-18 21:28:16,039 INFO L226 Difference]: Without dead ends: 80901 [2019-12-18 21:28:16,040 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:28:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80901 states. [2019-12-18 21:28:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80901 to 70357. [2019-12-18 21:28:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70357 states. [2019-12-18 21:28:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70357 states to 70357 states and 262789 transitions. [2019-12-18 21:28:18,244 INFO L78 Accepts]: Start accepts. Automaton has 70357 states and 262789 transitions. Word has length 39 [2019-12-18 21:28:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:18,244 INFO L462 AbstractCegarLoop]: Abstraction has 70357 states and 262789 transitions. [2019-12-18 21:28:18,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:28:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 70357 states and 262789 transitions. [2019-12-18 21:28:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:28:18,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:18,323 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:28:18,324 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:28:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1469371018, now seen corresponding path program 1 times [2019-12-18 21:28:18,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:18,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858197112] [2019-12-18 21:28:18,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:18,437 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:28:18,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858197112] [2019-12-18 21:28:18,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:18,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:18,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969550757] [2019-12-18 21:28:18,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:18,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:18,439 INFO L87 Difference]: Start difference. First operand 70357 states and 262789 transitions. Second operand 6 states. [2019-12-18 21:28:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:19,263 INFO L93 Difference]: Finished difference Result 64983 states and 238738 transitions. [2019-12-18 21:28:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:19,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 21:28:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:19,392 INFO L225 Difference]: With dead ends: 64983 [2019-12-18 21:28:19,392 INFO L226 Difference]: Without dead ends: 61647 [2019-12-18 21:28:19,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:28:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61647 states. [2019-12-18 21:28:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61647 to 46626. [2019-12-18 21:28:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46626 states. [2019-12-18 21:28:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46626 states to 46626 states and 172869 transitions. [2019-12-18 21:28:20,369 INFO L78 Accepts]: Start accepts. Automaton has 46626 states and 172869 transitions. Word has length 39 [2019-12-18 21:28:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:20,369 INFO L462 AbstractCegarLoop]: Abstraction has 46626 states and 172869 transitions. [2019-12-18 21:28:20,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 46626 states and 172869 transitions. [2019-12-18 21:28:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:28:20,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:20,415 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:28:20,415 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:28:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 74809353, now seen corresponding path program 1 times [2019-12-18 21:28:20,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:20,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308652659] [2019-12-18 21:28:20,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:20,537 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:28:20,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308652659] [2019-12-18 21:28:20,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:20,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:28:20,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118423056] [2019-12-18 21:28:20,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:28:20,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:28:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:28:20,542 INFO L87 Difference]: Start difference. First operand 46626 states and 172869 transitions. Second operand 9 states. [2019-12-18 21:28:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:21,503 INFO L93 Difference]: Finished difference Result 80809 states and 296699 transitions. [2019-12-18 21:28:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:28:21,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-18 21:28:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:21,655 INFO L225 Difference]: With dead ends: 80809 [2019-12-18 21:28:21,655 INFO L226 Difference]: Without dead ends: 71243 [2019-12-18 21:28:21,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:28:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71243 states. [2019-12-18 21:28:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71243 to 45594. [2019-12-18 21:28:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45594 states. [2019-12-18 21:28:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45594 states to 45594 states and 168630 transitions. [2019-12-18 21:28:23,255 INFO L78 Accepts]: Start accepts. Automaton has 45594 states and 168630 transitions. Word has length 39 [2019-12-18 21:28:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:23,256 INFO L462 AbstractCegarLoop]: Abstraction has 45594 states and 168630 transitions. [2019-12-18 21:28:23,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:28:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45594 states and 168630 transitions. [2019-12-18 21:28:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:28:23,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:23,301 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:28:23,301 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:28:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1161428045, now seen corresponding path program 1 times [2019-12-18 21:28:23,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:23,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254115503] [2019-12-18 21:28:23,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:23,383 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:28:23,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254115503] [2019-12-18 21:28:23,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:23,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:28:23,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787524795] [2019-12-18 21:28:23,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:28:23,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:23,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:28:23,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:28:23,385 INFO L87 Difference]: Start difference. First operand 45594 states and 168630 transitions. Second operand 5 states. [2019-12-18 21:28:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:23,489 INFO L93 Difference]: Finished difference Result 15925 states and 49673 transitions. [2019-12-18 21:28:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:28:23,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:28:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:23,517 INFO L225 Difference]: With dead ends: 15925 [2019-12-18 21:28:23,518 INFO L226 Difference]: Without dead ends: 15071 [2019-12-18 21:28:23,518 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:28:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-12-18 21:28:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15071. [2019-12-18 21:28:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-18 21:28:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 46944 transitions. [2019-12-18 21:28:23,762 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 46944 transitions. Word has length 40 [2019-12-18 21:28:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:23,762 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 46944 transitions. [2019-12-18 21:28:23,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:28:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 46944 transitions. [2019-12-18 21:28:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:28:23,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:23,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:23,774 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:28:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash -991967821, now seen corresponding path program 1 times [2019-12-18 21:28:23,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:23,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983134409] [2019-12-18 21:28:23,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:23,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983134409] [2019-12-18 21:28:23,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:23,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:23,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517110352] [2019-12-18 21:28:23,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:23,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:23,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:23,864 INFO L87 Difference]: Start difference. First operand 15071 states and 46944 transitions. Second operand 6 states. [2019-12-18 21:28:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:24,035 INFO L93 Difference]: Finished difference Result 25934 states and 80540 transitions. [2019-12-18 21:28:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:24,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 21:28:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:24,060 INFO L225 Difference]: With dead ends: 25934 [2019-12-18 21:28:24,060 INFO L226 Difference]: Without dead ends: 15168 [2019-12-18 21:28:24,061 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:28:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15168 states. [2019-12-18 21:28:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15168 to 15052. [2019-12-18 21:28:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15052 states. [2019-12-18 21:28:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 45199 transitions. [2019-12-18 21:28:24,297 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 45199 transitions. Word has length 41 [2019-12-18 21:28:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:24,297 INFO L462 AbstractCegarLoop]: Abstraction has 15052 states and 45199 transitions. [2019-12-18 21:28:24,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 45199 transitions. [2019-12-18 21:28:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:28:24,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:24,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:24,309 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:28:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 127761457, now seen corresponding path program 2 times [2019-12-18 21:28:24,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:24,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666935853] [2019-12-18 21:28:24,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:24,371 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:28:24,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666935853] [2019-12-18 21:28:24,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:24,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:24,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318453621] [2019-12-18 21:28:24,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:24,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:24,373 INFO L87 Difference]: Start difference. First operand 15052 states and 45199 transitions. Second operand 6 states. [2019-12-18 21:28:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:24,450 INFO L93 Difference]: Finished difference Result 3160 states and 7579 transitions. [2019-12-18 21:28:24,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:24,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 21:28:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:24,457 INFO L225 Difference]: With dead ends: 3160 [2019-12-18 21:28:24,457 INFO L226 Difference]: Without dead ends: 2813 [2019-12-18 21:28:24,458 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:28:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-12-18 21:28:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2737. [2019-12-18 21:28:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2019-12-18 21:28:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 6435 transitions. [2019-12-18 21:28:24,512 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 6435 transitions. Word has length 41 [2019-12-18 21:28:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:24,512 INFO L462 AbstractCegarLoop]: Abstraction has 2737 states and 6435 transitions. [2019-12-18 21:28:24,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 6435 transitions. [2019-12-18 21:28:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:28:24,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:24,517 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:28:24,518 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:28:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash 323536583, now seen corresponding path program 1 times [2019-12-18 21:28:24,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:24,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385288096] [2019-12-18 21:28:24,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:24,625 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:28:24,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385288096] [2019-12-18 21:28:24,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:24,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:28:24,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922088483] [2019-12-18 21:28:24,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:28:24,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:28:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:28:24,627 INFO L87 Difference]: Start difference. First operand 2737 states and 6435 transitions. Second operand 7 states. [2019-12-18 21:28:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:24,753 INFO L93 Difference]: Finished difference Result 1180 states and 3008 transitions. [2019-12-18 21:28:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:28:24,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 21:28:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:24,756 INFO L225 Difference]: With dead ends: 1180 [2019-12-18 21:28:24,756 INFO L226 Difference]: Without dead ends: 857 [2019-12-18 21:28:24,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:28:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-12-18 21:28:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 773. [2019-12-18 21:28:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 21:28:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1869 transitions. [2019-12-18 21:28:24,775 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1869 transitions. Word has length 48 [2019-12-18 21:28:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:24,775 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1869 transitions. [2019-12-18 21:28:24,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:28:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1869 transitions. [2019-12-18 21:28:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:28:24,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:24,778 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:28:24,778 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:28:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:24,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2083563203, now seen corresponding path program 1 times [2019-12-18 21:28:24,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:24,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87707392] [2019-12-18 21:28:24,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:28:24,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87707392] [2019-12-18 21:28:24,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:24,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:28:24,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038625348] [2019-12-18 21:28:24,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:28:24,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:28:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:28:24,901 INFO L87 Difference]: Start difference. First operand 773 states and 1869 transitions. Second operand 6 states. [2019-12-18 21:28:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:24,959 INFO L93 Difference]: Finished difference Result 955 states and 2200 transitions. [2019-12-18 21:28:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:28:24,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 21:28:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:24,960 INFO L225 Difference]: With dead ends: 955 [2019-12-18 21:28:24,960 INFO L226 Difference]: Without dead ends: 226 [2019-12-18 21:28:24,960 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:28:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-12-18 21:28:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-12-18 21:28:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-12-18 21:28:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 408 transitions. [2019-12-18 21:28:24,964 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 408 transitions. Word has length 59 [2019-12-18 21:28:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:24,965 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 408 transitions. [2019-12-18 21:28:24,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:28:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 408 transitions. [2019-12-18 21:28:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:28:24,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:24,966 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:28:24,966 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:28:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1168982425, now seen corresponding path program 2 times [2019-12-18 21:28:24,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:24,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585639213] [2019-12-18 21:28:24,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:25,029 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:28:25,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585639213] [2019-12-18 21:28:25,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:25,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:28:25,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858865137] [2019-12-18 21:28:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:28:25,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:28:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:28:25,033 INFO L87 Difference]: Start difference. First operand 226 states and 408 transitions. Second operand 3 states. [2019-12-18 21:28:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:25,046 INFO L93 Difference]: Finished difference Result 215 states and 375 transitions. [2019-12-18 21:28:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:28:25,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:28:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:25,047 INFO L225 Difference]: With dead ends: 215 [2019-12-18 21:28:25,047 INFO L226 Difference]: Without dead ends: 215 [2019-12-18 21:28:25,048 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:28:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-18 21:28:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-18 21:28:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 21:28:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 375 transitions. [2019-12-18 21:28:25,052 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 375 transitions. Word has length 59 [2019-12-18 21:28:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:25,053 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 375 transitions. [2019-12-18 21:28:25,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:28:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 375 transitions. [2019-12-18 21:28:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:25,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:25,054 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:28:25,054 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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:28:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash -450753008, now seen corresponding path program 1 times [2019-12-18 21:28:25,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:25,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980619197] [2019-12-18 21:28:25,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:25,308 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:28:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980619197] [2019-12-18 21:28:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:28:25,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596207756] [2019-12-18 21:28:25,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:28:25,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:28:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:28:25,309 INFO L87 Difference]: Start difference. First operand 215 states and 375 transitions. Second operand 13 states. [2019-12-18 21:28:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:26,129 INFO L93 Difference]: Finished difference Result 366 states and 621 transitions. [2019-12-18 21:28:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:28:26,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:28:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:26,131 INFO L225 Difference]: With dead ends: 366 [2019-12-18 21:28:26,131 INFO L226 Difference]: Without dead ends: 255 [2019-12-18 21:28:26,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:28:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-18 21:28:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 227. [2019-12-18 21:28:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-18 21:28:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 395 transitions. [2019-12-18 21:28:26,137 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 395 transitions. Word has length 60 [2019-12-18 21:28:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:26,137 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 395 transitions. [2019-12-18 21:28:26,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:28:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 395 transitions. [2019-12-18 21:28:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:26,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:26,139 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:28:26,139 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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:28:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1199767330, now seen corresponding path program 2 times [2019-12-18 21:28:26,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:26,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093276646] [2019-12-18 21:28:26,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:26,602 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:28:26,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093276646] [2019-12-18 21:28:26,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:26,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:28:26,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918303889] [2019-12-18 21:28:26,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:28:26,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:28:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:28:26,605 INFO L87 Difference]: Start difference. First operand 227 states and 395 transitions. Second operand 15 states. [2019-12-18 21:28:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:27,182 INFO L93 Difference]: Finished difference Result 338 states and 559 transitions. [2019-12-18 21:28:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:28:27,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:28:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:27,184 INFO L225 Difference]: With dead ends: 338 [2019-12-18 21:28:27,184 INFO L226 Difference]: Without dead ends: 247 [2019-12-18 21:28:27,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:28:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-18 21:28:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 223. [2019-12-18 21:28:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-18 21:28:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 386 transitions. [2019-12-18 21:28:27,189 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 386 transitions. Word has length 60 [2019-12-18 21:28:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:27,190 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 386 transitions. [2019-12-18 21:28:27,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:28:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 386 transitions. [2019-12-18 21:28:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:27,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:27,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:28:27,191 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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:28:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1921577050, now seen corresponding path program 3 times [2019-12-18 21:28:27,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:27,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129444442] [2019-12-18 21:28:27,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:28:27,415 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:28:27,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129444442] [2019-12-18 21:28:27,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:28:27,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:28:27,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333982444] [2019-12-18 21:28:27,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:28:27,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:28:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:28:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:28:27,417 INFO L87 Difference]: Start difference. First operand 223 states and 386 transitions. Second operand 12 states. [2019-12-18 21:28:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:28:27,742 INFO L93 Difference]: Finished difference Result 310 states and 511 transitions. [2019-12-18 21:28:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:28:27,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:28:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:28:27,743 INFO L225 Difference]: With dead ends: 310 [2019-12-18 21:28:27,743 INFO L226 Difference]: Without dead ends: 191 [2019-12-18 21:28:27,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:28:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-18 21:28:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-12-18 21:28:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-12-18 21:28:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 326 transitions. [2019-12-18 21:28:27,746 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 326 transitions. Word has length 60 [2019-12-18 21:28:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:28:27,746 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 326 transitions. [2019-12-18 21:28:27,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:28:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 326 transitions. [2019-12-18 21:28:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:28:27,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:28:27,747 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:28:27,748 INFO L410 AbstractCegarLoop]: === Iteration 28 === [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:28:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:28:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 790518800, now seen corresponding path program 4 times [2019-12-18 21:28:27,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:28:27,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522498630] [2019-12-18 21:28:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:28:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:28:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:28:27,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:28:27,930 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:28:27,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| 4) |v_#length_27|) (= 0 v_~z$w_buff1~0_23) (= v_~x~0_11 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21|) 0) (= 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_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21| 1)) (= 0 v_~z$flush_delayed~0_17) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd2~0_10) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1157~0.base_21|) (= 0 v_~z$w_buff1_used~0_64) (= 0 |v_ULTIMATE.start_main_~#t1157~0.offset_16|) (= v_~a~0_10 0) (= 0 v_~weak$$choice0~0_7) (= 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) (= 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) (= v_~z$r_buff0_thd3~0_22 0) (= 0 v_~z$r_buff1_thd3~0_17) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21|) |v_ULTIMATE.start_main_~#t1157~0.offset_16| 0)) |v_#memory_int_27|) (= 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_~#t1157~0.offset=|v_ULTIMATE.start_main_~#t1157~0.offset_16|, 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_~#t1157~0.base=|v_ULTIMATE.start_main_~#t1157~0.base_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ~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|, ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_22|, ~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, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_21|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~0.offset_16|, ~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_#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, ULTIMATE.start_main_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_22|, ~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_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_16|, ~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|, ~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|, ULTIMATE.start_main_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_16|, ~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_~#t1157~0.offset, 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_~#t1157~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1158~0.base, ~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, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1159~0.base, ULTIMATE.start_main_~#t1160~0.offset, ~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_#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, ULTIMATE.start_main_~#t1160~0.base, ~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_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1159~0.offset, ~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, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_~#t1158~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:28:27,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1158~0.base_12| 0)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1158~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1158~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12|) |v_ULTIMATE.start_main_~#t1158~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_12|, #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_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1158~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1158~0.offset] because there is no mapped edge [2019-12-18 21:28:27,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1159~0.offset_8|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1159~0.base_8|) (not (= 0 |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8|) |v_ULTIMATE.start_main_~#t1159~0.offset_8| 2))) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~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_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1159~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1159~0.offset] because there is no mapped edge [2019-12-18 21:28:27,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1160~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12|) |v_ULTIMATE.start_main_~#t1160~0.offset_10| 3)) |v_#memory_int_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1160~0.base_12|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| 4)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1160~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_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_12|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1160~0.base, ULTIMATE.start_main_~#t1160~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:28:27,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L812: Formula: (and (= ~z$r_buff1_thd4~0_Out-1837616162 ~z$r_buff0_thd4~0_In-1837616162) (= ~z$r_buff0_thd4~0_Out-1837616162 1) (= ~z$r_buff0_thd3~0_In-1837616162 ~z$r_buff1_thd3~0_Out-1837616162) (= ~z$r_buff1_thd1~0_Out-1837616162 ~z$r_buff0_thd1~0_In-1837616162) (= ~z$r_buff0_thd0~0_In-1837616162 ~z$r_buff1_thd0~0_Out-1837616162) (= ~a~0_Out-1837616162 ~__unbuffered_p3_EAX~0_Out-1837616162) (= ~z$r_buff1_thd2~0_Out-1837616162 ~z$r_buff0_thd2~0_In-1837616162) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1837616162 0)) (= ~__unbuffered_p3_EBX~0_Out-1837616162 ~b~0_In-1837616162) (= 1 ~a~0_Out-1837616162)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1837616162, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1837616162, ~b~0=~b~0_In-1837616162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1837616162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837616162, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837616162, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1837616162} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1837616162, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1837616162, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1837616162, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1837616162, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1837616162, ~a~0=~a~0_Out-1837616162, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1837616162, ~b~0=~b~0_In-1837616162, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1837616162, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1837616162, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1837616162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1837616162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837616162, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1837616162, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1837616162} 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:28:27,943 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:28:27,944 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:28:27,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-168833930 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-168833930 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-168833930|) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-168833930| ~z$w_buff0_used~0_In-168833930) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-168833930, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-168833930} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-168833930, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-168833930, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-168833930|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:28:27,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2128093578 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2128093578 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-2128093578 |P2Thread1of1ForFork2_#t~ite3_Out-2128093578|)) (and (= ~z$w_buff1~0_In-2128093578 |P2Thread1of1ForFork2_#t~ite3_Out-2128093578|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2128093578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2128093578, ~z$w_buff1~0=~z$w_buff1~0_In-2128093578, ~z~0=~z~0_In-2128093578} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-2128093578|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2128093578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2128093578, ~z$w_buff1~0=~z$w_buff1~0_In-2128093578, ~z~0=~z~0_In-2128093578} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:28:27,947 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:28:27,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In259404006 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In259404006 256)))) (or (and (= ~z$w_buff0_used~0_In259404006 |P2Thread1of1ForFork2_#t~ite5_Out259404006|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out259404006|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In259404006, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In259404006} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out259404006|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In259404006, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In259404006} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:28:27,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In402033867 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In402033867 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In402033867 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In402033867 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out402033867| ~z$w_buff1_used~0_In402033867) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out402033867| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In402033867, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In402033867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In402033867, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In402033867} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out402033867|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In402033867, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In402033867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In402033867, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In402033867} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:28:27,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In722729901 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In722729901 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out722729901|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In722729901 |P2Thread1of1ForFork2_#t~ite7_Out722729901|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In722729901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In722729901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In722729901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In722729901, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out722729901|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:28:27,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In60496835 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In60496835 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In60496835 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In60496835 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out60496835|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In60496835 |P2Thread1of1ForFork2_#t~ite8_Out60496835|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In60496835, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In60496835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60496835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In60496835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In60496835, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In60496835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60496835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In60496835, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out60496835|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:28:27,951 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:28:27,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1698663302 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1698663302 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1698663302 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1698663302 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1698663302|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1698663302 |P3Thread1of1ForFork3_#t~ite12_Out1698663302|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1698663302, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1698663302, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1698663302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1698663302} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1698663302, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1698663302, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1698663302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1698663302, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1698663302|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:28:27,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-475723235 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-475723235 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-475723235 0)) (and (= ~z$r_buff0_thd4~0_Out-475723235 ~z$r_buff0_thd4~0_In-475723235) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-475723235, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-475723235} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-475723235, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-475723235, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-475723235|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:28:27,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In1210826642 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1210826642 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1210826642 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1210826642 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1210826642| ~z$r_buff1_thd4~0_In1210826642) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork3_#t~ite14_Out1210826642| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210826642, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210826642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210826642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210826642} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210826642, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210826642, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1210826642|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210826642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210826642} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:28:27,953 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:28:27,954 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:28:27,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1675041780 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1675041780 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite20_Out1675041780| |ULTIMATE.start_main_#t~ite19_Out1675041780|))) (or (and (= ~z$w_buff1~0_In1675041780 |ULTIMATE.start_main_#t~ite19_Out1675041780|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In1675041780 |ULTIMATE.start_main_#t~ite19_Out1675041780|) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1675041780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675041780, ~z$w_buff1~0=~z$w_buff1~0_In1675041780, ~z~0=~z~0_In1675041780} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1675041780|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1675041780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675041780, ~z$w_buff1~0=~z$w_buff1~0_In1675041780, ~z~0=~z~0_In1675041780, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1675041780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:28:27,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1795209375 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1795209375 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1795209375| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1795209375| ~z$w_buff0_used~0_In-1795209375) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1795209375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795209375} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1795209375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795209375, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1795209375|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:28:27,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In734827679 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In734827679 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In734827679 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In734827679 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out734827679|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In734827679 |ULTIMATE.start_main_#t~ite22_Out734827679|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In734827679, ~z$w_buff0_used~0=~z$w_buff0_used~0_In734827679, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In734827679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In734827679} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In734827679, ~z$w_buff0_used~0=~z$w_buff0_used~0_In734827679, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In734827679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In734827679, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out734827679|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:28:27,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-77184021 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-77184021 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-77184021| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-77184021| ~z$r_buff0_thd0~0_In-77184021)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-77184021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-77184021} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-77184021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-77184021, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-77184021|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:28:27,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1696075634 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1696075634 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1696075634 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1696075634 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1696075634|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-1696075634 |ULTIMATE.start_main_#t~ite24_Out-1696075634|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1696075634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696075634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1696075634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696075634} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1696075634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696075634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1696075634, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1696075634|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696075634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:28:27,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L861-->L861-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-756917289 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-756917289 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-756917289 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-756917289 256)) .cse0) (and (= (mod ~z$w_buff1_used~0_In-756917289 256) 0) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite37_Out-756917289| |ULTIMATE.start_main_#t~ite36_Out-756917289|) (= ~z$w_buff0_used~0_In-756917289 |ULTIMATE.start_main_#t~ite36_Out-756917289|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-756917289| ~z$w_buff0_used~0_In-756917289) (= |ULTIMATE.start_main_#t~ite36_In-756917289| |ULTIMATE.start_main_#t~ite36_Out-756917289|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-756917289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-756917289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-756917289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-756917289, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-756917289|, ~weak$$choice2~0=~weak$$choice2~0_In-756917289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-756917289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-756917289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-756917289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-756917289, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-756917289|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-756917289|, ~weak$$choice2~0=~weak$$choice2~0_In-756917289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:28:27,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-507977160 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_In-507977160| |ULTIMATE.start_main_#t~ite39_Out-507977160|) (not .cse0) (= ~z$w_buff1_used~0_In-507977160 |ULTIMATE.start_main_#t~ite40_Out-507977160|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-507977160| |ULTIMATE.start_main_#t~ite39_Out-507977160|) .cse0 (= ~z$w_buff1_used~0_In-507977160 |ULTIMATE.start_main_#t~ite39_Out-507977160|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-507977160 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-507977160 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-507977160 256) 0)) (= (mod ~z$w_buff0_used~0_In-507977160 256) 0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-507977160, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-507977160, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-507977160|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-507977160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507977160, ~weak$$choice2~0=~weak$$choice2~0_In-507977160} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-507977160, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-507977160|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-507977160|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-507977160, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-507977160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-507977160, ~weak$$choice2~0=~weak$$choice2~0_In-507977160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:28:27,966 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:28:27,967 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:28:27,968 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:28:28,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:28:28 BasicIcfg [2019-12-18 21:28:28,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:28:28,108 INFO L168 Benchmark]: Toolchain (without parser) took 110115.89 ms. Allocated memory was 136.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 21:28:28,109 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 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:28:28,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.65 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 152.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:28:28,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.5 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:28:28,118 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 147.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:28:28,119 INFO L168 Benchmark]: RCFGBuilder took 914.06 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 97.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:28:28,120 INFO L168 Benchmark]: TraceAbstraction took 108260.38 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 21:28:28,125 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.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.65 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 152.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 147.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 914.06 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 97.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108260.38 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 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(&t1157, ((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(&t1158, ((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(&t1159, ((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(&t1160, ((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: 107.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4212 SDtfs, 5217 SDslu, 14189 SDs, 0 SdLazy, 6277 SolverSat, 329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 27 SyntacticMatches, 22 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112094occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 311326 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1096 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 218868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...