/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/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:49:33,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:49:33,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:49:33,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:49:33,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:49:33,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:49:33,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:49:33,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:49:33,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:49:33,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:49:33,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:49:33,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:49:33,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:49:33,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:49:33,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:49:33,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:49:33,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:49:33,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:49:33,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:49:33,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:49:33,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:49:33,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:49:33,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:49:33,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:49:33,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:49:33,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:49:33,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:49:33,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:49:33,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:49:33,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:49:33,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:49:33,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:49:33,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:49:33,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:49:33,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:49:33,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:49:33,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:49:33,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:49:33,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:49:33,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:49:33,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:49:33,647 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 20:49:33,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:49:33,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:49:33,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:49:33,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:49:33,674 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:49:33,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:49:33,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:49:33,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:49:33,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:49:33,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:49:33,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:49:33,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:49:33,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:49:33,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:49:33,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:49:33,677 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:49:33,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:49:33,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:49:33,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:49:33,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:49:33,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:49:33,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:49:33,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:49:33,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:49:33,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:49:33,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:49:33,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:49:33,680 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:49:33,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:49:33,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:49:33,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:49:33,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:49:33,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:49:33,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:49:33,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:49:33,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-18 20:49:34,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57bd74ed/02b3d4779b984b71b5ae49ba5aab6cf2/FLAGd27c7ccd8 [2019-12-18 20:49:34,662 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:49:34,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-18 20:49:34,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57bd74ed/02b3d4779b984b71b5ae49ba5aab6cf2/FLAGd27c7ccd8 [2019-12-18 20:49:34,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57bd74ed/02b3d4779b984b71b5ae49ba5aab6cf2 [2019-12-18 20:49:34,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:49:34,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:49:34,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:49:34,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:49:34,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:49:34,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:49:34" (1/1) ... [2019-12-18 20:49:34,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab71dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:34, skipping insertion in model container [2019-12-18 20:49:34,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:49:34" (1/1) ... [2019-12-18 20:49:34,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:49:34,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:49:35,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:49:35,536 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:49:35,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:49:35,709 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:49:35,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35 WrapperNode [2019-12-18 20:49:35,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:49:35,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:49:35,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:49:35,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:49:35,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:49:35,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:49:35,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:49:35,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:49:35,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (1/1) ... [2019-12-18 20:49:35,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:49:35,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:49:35,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:49:35,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:49:35,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (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 20:49:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:49:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:49:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:49:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:49:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:49:35,891 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:49:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:49:35,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:49:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:49:35,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:49:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:49:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:49:35,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:49:35,895 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 20:49:36,712 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:49:36,712 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:49:36,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:49:36 BoogieIcfgContainer [2019-12-18 20:49:36,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:49:36,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:49:36,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:49:36,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:49:36,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:49:34" (1/3) ... [2019-12-18 20:49:36,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0f162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:49:36, skipping insertion in model container [2019-12-18 20:49:36,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:49:35" (2/3) ... [2019-12-18 20:49:36,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0f162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:49:36, skipping insertion in model container [2019-12-18 20:49:36,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:49:36" (3/3) ... [2019-12-18 20:49:36,725 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2019-12-18 20:49:36,735 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:49:36,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:49:36,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:49:36,743 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:49:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,862 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,863 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,871 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,879 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,880 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:49:36,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:49:36,927 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:49:36,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:49:36,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:49:36,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:49:36,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:49:36,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:49:36,928 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:49:36,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:49:36,947 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 20:49:36,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 20:49:37,029 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 20:49:37,030 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:49:37,049 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:49:37,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 20:49:37,122 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 20:49:37,122 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:49:37,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:49:37,156 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:49:37,157 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:49:40,867 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:49:41,019 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:49:41,040 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68107 [2019-12-18 20:49:41,040 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 20:49:41,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 20:49:52,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 20:49:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 20:49:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:49:52,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:52,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:49:52,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:49:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 799324594, now seen corresponding path program 1 times [2019-12-18 20:49:52,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:52,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689520049] [2019-12-18 20:49:52,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:53,204 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 20:49:53,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689520049] [2019-12-18 20:49:53,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:53,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:49:53,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085556539] [2019-12-18 20:49:53,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:53,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:53,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:53,228 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 20:49:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:55,406 INFO L93 Difference]: Finished difference Result 87213 states and 375136 transitions. [2019-12-18 20:49:55,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:55,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:49:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:56,057 INFO L225 Difference]: With dead ends: 87213 [2019-12-18 20:49:56,057 INFO L226 Difference]: Without dead ends: 82117 [2019-12-18 20:49:56,059 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 20:50:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82117 states. [2019-12-18 20:50:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82117 to 82117. [2019-12-18 20:50:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82117 states. [2019-12-18 20:50:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82117 states to 82117 states and 352722 transitions. [2019-12-18 20:50:05,544 INFO L78 Accepts]: Start accepts. Automaton has 82117 states and 352722 transitions. Word has length 5 [2019-12-18 20:50:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:05,544 INFO L462 AbstractCegarLoop]: Abstraction has 82117 states and 352722 transitions. [2019-12-18 20:50:05,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 82117 states and 352722 transitions. [2019-12-18 20:50:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:50:05,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:05,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:05,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1561636486, now seen corresponding path program 1 times [2019-12-18 20:50:05,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:05,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738258050] [2019-12-18 20:50:05,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:05,724 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 20:50:05,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738258050] [2019-12-18 20:50:05,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:05,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:05,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574573080] [2019-12-18 20:50:05,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:05,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:05,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:05,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:05,729 INFO L87 Difference]: Start difference. First operand 82117 states and 352722 transitions. Second operand 4 states. [2019-12-18 20:50:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:10,101 INFO L93 Difference]: Finished difference Result 125342 states and 514910 transitions. [2019-12-18 20:50:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:10,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:50:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:10,609 INFO L225 Difference]: With dead ends: 125342 [2019-12-18 20:50:10,609 INFO L226 Difference]: Without dead ends: 125251 [2019-12-18 20:50:10,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125251 states. [2019-12-18 20:50:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125251 to 113136. [2019-12-18 20:50:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113136 states. [2019-12-18 20:50:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113136 states to 113136 states and 471690 transitions. [2019-12-18 20:50:16,885 INFO L78 Accepts]: Start accepts. Automaton has 113136 states and 471690 transitions. Word has length 13 [2019-12-18 20:50:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:16,886 INFO L462 AbstractCegarLoop]: Abstraction has 113136 states and 471690 transitions. [2019-12-18 20:50:16,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 113136 states and 471690 transitions. [2019-12-18 20:50:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:50:16,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:16,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:16,890 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash 994155576, now seen corresponding path program 1 times [2019-12-18 20:50:16,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:16,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208857533] [2019-12-18 20:50:16,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:17,035 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 20:50:17,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208857533] [2019-12-18 20:50:17,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:17,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:17,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553324512] [2019-12-18 20:50:17,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:17,038 INFO L87 Difference]: Start difference. First operand 113136 states and 471690 transitions. Second operand 4 states. [2019-12-18 20:50:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:20,529 INFO L93 Difference]: Finished difference Result 36342 states and 127270 transitions. [2019-12-18 20:50:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:20,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:50:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:20,584 INFO L225 Difference]: With dead ends: 36342 [2019-12-18 20:50:20,584 INFO L226 Difference]: Without dead ends: 28573 [2019-12-18 20:50:20,584 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 20:50:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28573 states. [2019-12-18 20:50:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28573 to 28509. [2019-12-18 20:50:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28509 states. [2019-12-18 20:50:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28509 states to 28509 states and 96204 transitions. [2019-12-18 20:50:21,139 INFO L78 Accepts]: Start accepts. Automaton has 28509 states and 96204 transitions. Word has length 13 [2019-12-18 20:50:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:21,139 INFO L462 AbstractCegarLoop]: Abstraction has 28509 states and 96204 transitions. [2019-12-18 20:50:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28509 states and 96204 transitions. [2019-12-18 20:50:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:21,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:21,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:21,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1804075732, now seen corresponding path program 1 times [2019-12-18 20:50:21,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:21,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972457900] [2019-12-18 20:50:21,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:21,207 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 20:50:21,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972457900] [2019-12-18 20:50:21,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:21,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:21,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136898208] [2019-12-18 20:50:21,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:21,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:21,209 INFO L87 Difference]: Start difference. First operand 28509 states and 96204 transitions. Second operand 4 states. [2019-12-18 20:50:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:21,654 INFO L93 Difference]: Finished difference Result 36737 states and 121975 transitions. [2019-12-18 20:50:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:21,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:50:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:21,720 INFO L225 Difference]: With dead ends: 36737 [2019-12-18 20:50:21,721 INFO L226 Difference]: Without dead ends: 36639 [2019-12-18 20:50:21,721 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 20:50:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36639 states. [2019-12-18 20:50:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36639 to 32064. [2019-12-18 20:50:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32064 states. [2019-12-18 20:50:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32064 states to 32064 states and 107530 transitions. [2019-12-18 20:50:22,643 INFO L78 Accepts]: Start accepts. Automaton has 32064 states and 107530 transitions. Word has length 14 [2019-12-18 20:50:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 32064 states and 107530 transitions. [2019-12-18 20:50:22,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 32064 states and 107530 transitions. [2019-12-18 20:50:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:22,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:22,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:22,646 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1804212504, now seen corresponding path program 1 times [2019-12-18 20:50:22,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:22,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374837294] [2019-12-18 20:50:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:22,691 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 20:50:22,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374837294] [2019-12-18 20:50:22,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:22,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:22,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375087876] [2019-12-18 20:50:22,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:22,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:22,693 INFO L87 Difference]: Start difference. First operand 32064 states and 107530 transitions. Second operand 3 states. [2019-12-18 20:50:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:22,893 INFO L93 Difference]: Finished difference Result 47423 states and 159916 transitions. [2019-12-18 20:50:22,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:22,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 20:50:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:22,982 INFO L225 Difference]: With dead ends: 47423 [2019-12-18 20:50:22,982 INFO L226 Difference]: Without dead ends: 47423 [2019-12-18 20:50:22,982 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 20:50:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47423 states. [2019-12-18 20:50:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47423 to 37143. [2019-12-18 20:50:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-12-18 20:50:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 124911 transitions. [2019-12-18 20:50:24,178 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 124911 transitions. Word has length 14 [2019-12-18 20:50:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:24,179 INFO L462 AbstractCegarLoop]: Abstraction has 37143 states and 124911 transitions. [2019-12-18 20:50:24,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 124911 transitions. [2019-12-18 20:50:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:50:24,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:24,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:24,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1968777988, now seen corresponding path program 1 times [2019-12-18 20:50:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:24,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851302615] [2019-12-18 20:50:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:24,245 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 20:50:24,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851302615] [2019-12-18 20:50:24,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:24,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:24,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269235405] [2019-12-18 20:50:24,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:24,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:24,249 INFO L87 Difference]: Start difference. First operand 37143 states and 124911 transitions. Second operand 4 states. [2019-12-18 20:50:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:24,607 INFO L93 Difference]: Finished difference Result 44051 states and 146328 transitions. [2019-12-18 20:50:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:24,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:50:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:24,685 INFO L225 Difference]: With dead ends: 44051 [2019-12-18 20:50:24,685 INFO L226 Difference]: Without dead ends: 43953 [2019-12-18 20:50:24,686 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 20:50:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43953 states. [2019-12-18 20:50:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43953 to 37562. [2019-12-18 20:50:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37562 states. [2019-12-18 20:50:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37562 states to 37562 states and 126032 transitions. [2019-12-18 20:50:25,378 INFO L78 Accepts]: Start accepts. Automaton has 37562 states and 126032 transitions. Word has length 14 [2019-12-18 20:50:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:25,379 INFO L462 AbstractCegarLoop]: Abstraction has 37562 states and 126032 transitions. [2019-12-18 20:50:25,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37562 states and 126032 transitions. [2019-12-18 20:50:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:50:25,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:25,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:25,393 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash 464033414, now seen corresponding path program 1 times [2019-12-18 20:50:25,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:25,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718709399] [2019-12-18 20:50:25,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:25,485 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 20:50:25,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718709399] [2019-12-18 20:50:25,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:25,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:25,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966229999] [2019-12-18 20:50:25,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:25,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:25,488 INFO L87 Difference]: Start difference. First operand 37562 states and 126032 transitions. Second operand 5 states. [2019-12-18 20:50:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:26,446 INFO L93 Difference]: Finished difference Result 50496 states and 166168 transitions. [2019-12-18 20:50:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:50:26,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:50:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:26,533 INFO L225 Difference]: With dead ends: 50496 [2019-12-18 20:50:26,533 INFO L226 Difference]: Without dead ends: 50306 [2019-12-18 20:50:26,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50306 states. [2019-12-18 20:50:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50306 to 38560. [2019-12-18 20:50:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-18 20:50:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 129178 transitions. [2019-12-18 20:50:27,258 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 129178 transitions. Word has length 22 [2019-12-18 20:50:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:27,258 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 129178 transitions. [2019-12-18 20:50:27,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 129178 transitions. [2019-12-18 20:50:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:50:27,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:27,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:27,270 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1825144588, now seen corresponding path program 1 times [2019-12-18 20:50:27,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:27,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658216055] [2019-12-18 20:50:27,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:27,356 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 20:50:27,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658216055] [2019-12-18 20:50:27,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:27,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:27,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258227452] [2019-12-18 20:50:27,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:27,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:27,359 INFO L87 Difference]: Start difference. First operand 38560 states and 129178 transitions. Second operand 5 states. [2019-12-18 20:50:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:27,955 INFO L93 Difference]: Finished difference Result 51048 states and 167840 transitions. [2019-12-18 20:50:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:50:27,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:50:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:28,045 INFO L225 Difference]: With dead ends: 51048 [2019-12-18 20:50:28,045 INFO L226 Difference]: Without dead ends: 50780 [2019-12-18 20:50:28,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50780 states. [2019-12-18 20:50:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50780 to 36339. [2019-12-18 20:50:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36339 states. [2019-12-18 20:50:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36339 states to 36339 states and 121828 transitions. [2019-12-18 20:50:29,187 INFO L78 Accepts]: Start accepts. Automaton has 36339 states and 121828 transitions. Word has length 22 [2019-12-18 20:50:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:29,187 INFO L462 AbstractCegarLoop]: Abstraction has 36339 states and 121828 transitions. [2019-12-18 20:50:29,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36339 states and 121828 transitions. [2019-12-18 20:50:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:50:29,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:29,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:29,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2069776038, now seen corresponding path program 1 times [2019-12-18 20:50:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592144427] [2019-12-18 20:50:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:29,294 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 20:50:29,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592144427] [2019-12-18 20:50:29,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:29,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:29,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579266425] [2019-12-18 20:50:29,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:29,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:29,297 INFO L87 Difference]: Start difference. First operand 36339 states and 121828 transitions. Second operand 5 states. [2019-12-18 20:50:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:29,821 INFO L93 Difference]: Finished difference Result 48916 states and 160536 transitions. [2019-12-18 20:50:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:29,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 20:50:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:29,905 INFO L225 Difference]: With dead ends: 48916 [2019-12-18 20:50:29,905 INFO L226 Difference]: Without dead ends: 48889 [2019-12-18 20:50:29,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2019-12-18 20:50:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 41136. [2019-12-18 20:50:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41136 states. [2019-12-18 20:50:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41136 states to 41136 states and 136683 transitions. [2019-12-18 20:50:31,206 INFO L78 Accepts]: Start accepts. Automaton has 41136 states and 136683 transitions. Word has length 25 [2019-12-18 20:50:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 41136 states and 136683 transitions. [2019-12-18 20:50:31,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 41136 states and 136683 transitions. [2019-12-18 20:50:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:50:31,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:31,226 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] [2019-12-18 20:50:31,226 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1235001231, now seen corresponding path program 1 times [2019-12-18 20:50:31,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:31,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292283012] [2019-12-18 20:50:31,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:31,296 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 20:50:31,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292283012] [2019-12-18 20:50:31,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:31,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:31,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141525792] [2019-12-18 20:50:31,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:31,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:31,298 INFO L87 Difference]: Start difference. First operand 41136 states and 136683 transitions. Second operand 5 states. [2019-12-18 20:50:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:31,404 INFO L93 Difference]: Finished difference Result 17698 states and 55060 transitions. [2019-12-18 20:50:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:31,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:50:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:31,426 INFO L225 Difference]: With dead ends: 17698 [2019-12-18 20:50:31,426 INFO L226 Difference]: Without dead ends: 15112 [2019-12-18 20:50:31,427 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 20:50:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2019-12-18 20:50:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 14720. [2019-12-18 20:50:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14720 states. [2019-12-18 20:50:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14720 states to 14720 states and 45519 transitions. [2019-12-18 20:50:31,631 INFO L78 Accepts]: Start accepts. Automaton has 14720 states and 45519 transitions. Word has length 28 [2019-12-18 20:50:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:31,632 INFO L462 AbstractCegarLoop]: Abstraction has 14720 states and 45519 transitions. [2019-12-18 20:50:31,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 14720 states and 45519 transitions. [2019-12-18 20:50:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:31,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:31,652 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 20:50:31,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1619802347, now seen corresponding path program 1 times [2019-12-18 20:50:31,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:31,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428264618] [2019-12-18 20:50:31,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:31,734 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 20:50:31,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428264618] [2019-12-18 20:50:31,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:31,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:31,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769989981] [2019-12-18 20:50:31,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:31,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:31,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:31,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:31,736 INFO L87 Difference]: Start difference. First operand 14720 states and 45519 transitions. Second operand 5 states. [2019-12-18 20:50:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:32,319 INFO L93 Difference]: Finished difference Result 21622 states and 66199 transitions. [2019-12-18 20:50:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:32,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 20:50:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:32,367 INFO L225 Difference]: With dead ends: 21622 [2019-12-18 20:50:32,367 INFO L226 Difference]: Without dead ends: 21622 [2019-12-18 20:50:32,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21622 states. [2019-12-18 20:50:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21622 to 19702. [2019-12-18 20:50:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19702 states. [2019-12-18 20:50:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19702 states to 19702 states and 60795 transitions. [2019-12-18 20:50:32,718 INFO L78 Accepts]: Start accepts. Automaton has 19702 states and 60795 transitions. Word has length 39 [2019-12-18 20:50:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:32,718 INFO L462 AbstractCegarLoop]: Abstraction has 19702 states and 60795 transitions. [2019-12-18 20:50:32,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19702 states and 60795 transitions. [2019-12-18 20:50:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:32,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:32,748 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 20:50:32,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1504147243, now seen corresponding path program 2 times [2019-12-18 20:50:32,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:32,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388969150] [2019-12-18 20:50:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:32,825 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 20:50:32,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388969150] [2019-12-18 20:50:32,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:32,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:32,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872214558] [2019-12-18 20:50:32,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:32,827 INFO L87 Difference]: Start difference. First operand 19702 states and 60795 transitions. Second operand 3 states. [2019-12-18 20:50:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:32,901 INFO L93 Difference]: Finished difference Result 18777 states and 57281 transitions. [2019-12-18 20:50:32,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:32,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:50:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:32,939 INFO L225 Difference]: With dead ends: 18777 [2019-12-18 20:50:32,939 INFO L226 Difference]: Without dead ends: 18777 [2019-12-18 20:50:32,939 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 20:50:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18777 states. [2019-12-18 20:50:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18777 to 18641. [2019-12-18 20:50:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18641 states. [2019-12-18 20:50:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18641 states to 18641 states and 56901 transitions. [2019-12-18 20:50:33,201 INFO L78 Accepts]: Start accepts. Automaton has 18641 states and 56901 transitions. Word has length 39 [2019-12-18 20:50:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:33,202 INFO L462 AbstractCegarLoop]: Abstraction has 18641 states and 56901 transitions. [2019-12-18 20:50:33,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 18641 states and 56901 transitions. [2019-12-18 20:50:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:33,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:33,224 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 20:50:33,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash -942169455, now seen corresponding path program 1 times [2019-12-18 20:50:33,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:33,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211221378] [2019-12-18 20:50:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:33,313 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 20:50:33,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211221378] [2019-12-18 20:50:33,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:33,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:33,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166789358] [2019-12-18 20:50:33,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:33,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:33,317 INFO L87 Difference]: Start difference. First operand 18641 states and 56901 transitions. Second operand 5 states. [2019-12-18 20:50:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:33,644 INFO L93 Difference]: Finished difference Result 21596 states and 65074 transitions. [2019-12-18 20:50:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:33,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:50:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:33,675 INFO L225 Difference]: With dead ends: 21596 [2019-12-18 20:50:33,675 INFO L226 Difference]: Without dead ends: 21594 [2019-12-18 20:50:33,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21594 states. [2019-12-18 20:50:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21594 to 18864. [2019-12-18 20:50:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18864 states. [2019-12-18 20:50:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18864 states to 18864 states and 57518 transitions. [2019-12-18 20:50:34,147 INFO L78 Accepts]: Start accepts. Automaton has 18864 states and 57518 transitions. Word has length 40 [2019-12-18 20:50:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:34,147 INFO L462 AbstractCegarLoop]: Abstraction has 18864 states and 57518 transitions. [2019-12-18 20:50:34,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18864 states and 57518 transitions. [2019-12-18 20:50:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:34,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:34,168 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 20:50:34,169 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:34,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1669894095, now seen corresponding path program 2 times [2019-12-18 20:50:34,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:34,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687184542] [2019-12-18 20:50:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:34,290 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 20:50:34,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687184542] [2019-12-18 20:50:34,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:34,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:34,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970552939] [2019-12-18 20:50:34,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:34,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:34,292 INFO L87 Difference]: Start difference. First operand 18864 states and 57518 transitions. Second operand 6 states. [2019-12-18 20:50:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:35,007 INFO L93 Difference]: Finished difference Result 22429 states and 67296 transitions. [2019-12-18 20:50:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:35,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:50:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:35,039 INFO L225 Difference]: With dead ends: 22429 [2019-12-18 20:50:35,039 INFO L226 Difference]: Without dead ends: 22427 [2019-12-18 20:50:35,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22427 states. [2019-12-18 20:50:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22427 to 18652. [2019-12-18 20:50:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18652 states. [2019-12-18 20:50:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18652 states to 18652 states and 56852 transitions. [2019-12-18 20:50:35,328 INFO L78 Accepts]: Start accepts. Automaton has 18652 states and 56852 transitions. Word has length 40 [2019-12-18 20:50:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:35,329 INFO L462 AbstractCegarLoop]: Abstraction has 18652 states and 56852 transitions. [2019-12-18 20:50:35,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 18652 states and 56852 transitions. [2019-12-18 20:50:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:35,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:35,356 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 20:50:35,356 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1515515867, now seen corresponding path program 1 times [2019-12-18 20:50:35,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:35,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901096046] [2019-12-18 20:50:35,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:35,450 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 20:50:35,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901096046] [2019-12-18 20:50:35,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:35,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:35,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191901258] [2019-12-18 20:50:35,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:35,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:35,452 INFO L87 Difference]: Start difference. First operand 18652 states and 56852 transitions. Second operand 6 states. [2019-12-18 20:50:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:36,488 INFO L93 Difference]: Finished difference Result 24871 states and 74529 transitions. [2019-12-18 20:50:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:36,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:50:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:36,530 INFO L225 Difference]: With dead ends: 24871 [2019-12-18 20:50:36,530 INFO L226 Difference]: Without dead ends: 24871 [2019-12-18 20:50:36,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:50:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24871 states. [2019-12-18 20:50:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24871 to 19295. [2019-12-18 20:50:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19295 states. [2019-12-18 20:50:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19295 states to 19295 states and 58829 transitions. [2019-12-18 20:50:36,840 INFO L78 Accepts]: Start accepts. Automaton has 19295 states and 58829 transitions. Word has length 40 [2019-12-18 20:50:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:36,840 INFO L462 AbstractCegarLoop]: Abstraction has 19295 states and 58829 transitions. [2019-12-18 20:50:36,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19295 states and 58829 transitions. [2019-12-18 20:50:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:36,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:36,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:36,869 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:36,869 INFO L82 PathProgramCache]: Analyzing trace with hash -654521051, now seen corresponding path program 2 times [2019-12-18 20:50:36,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:36,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113226669] [2019-12-18 20:50:36,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:36,919 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 20:50:36,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113226669] [2019-12-18 20:50:36,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:36,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:36,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724432667] [2019-12-18 20:50:36,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:36,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:36,921 INFO L87 Difference]: Start difference. First operand 19295 states and 58829 transitions. Second operand 3 states. [2019-12-18 20:50:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:37,197 INFO L93 Difference]: Finished difference Result 19207 states and 58524 transitions. [2019-12-18 20:50:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:37,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:50:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:37,222 INFO L225 Difference]: With dead ends: 19207 [2019-12-18 20:50:37,222 INFO L226 Difference]: Without dead ends: 19207 [2019-12-18 20:50:37,223 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 20:50:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2019-12-18 20:50:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 16806. [2019-12-18 20:50:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2019-12-18 20:50:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 51634 transitions. [2019-12-18 20:50:37,471 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 51634 transitions. Word has length 40 [2019-12-18 20:50:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 16806 states and 51634 transitions. [2019-12-18 20:50:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 51634 transitions. [2019-12-18 20:50:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:50:37,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:37,490 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 20:50:37,491 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -835331995, now seen corresponding path program 1 times [2019-12-18 20:50:37,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:37,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36269735] [2019-12-18 20:50:37,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:37,592 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 20:50:37,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36269735] [2019-12-18 20:50:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:37,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080074431] [2019-12-18 20:50:37,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:37,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:37,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:37,595 INFO L87 Difference]: Start difference. First operand 16806 states and 51634 transitions. Second operand 6 states. [2019-12-18 20:50:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:38,247 INFO L93 Difference]: Finished difference Result 20362 states and 61341 transitions. [2019-12-18 20:50:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:38,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 20:50:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:38,275 INFO L225 Difference]: With dead ends: 20362 [2019-12-18 20:50:38,275 INFO L226 Difference]: Without dead ends: 20360 [2019-12-18 20:50:38,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-18 20:50:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 16404. [2019-12-18 20:50:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16404 states. [2019-12-18 20:50:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16404 states to 16404 states and 50463 transitions. [2019-12-18 20:50:38,529 INFO L78 Accepts]: Start accepts. Automaton has 16404 states and 50463 transitions. Word has length 41 [2019-12-18 20:50:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:38,530 INFO L462 AbstractCegarLoop]: Abstraction has 16404 states and 50463 transitions. [2019-12-18 20:50:38,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16404 states and 50463 transitions. [2019-12-18 20:50:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:50:38,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:38,546 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 20:50:38,546 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:38,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1731134395, now seen corresponding path program 1 times [2019-12-18 20:50:38,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:38,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426749667] [2019-12-18 20:50:38,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:38,640 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 20:50:38,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426749667] [2019-12-18 20:50:38,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:38,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:38,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226552778] [2019-12-18 20:50:38,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:38,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:38,642 INFO L87 Difference]: Start difference. First operand 16404 states and 50463 transitions. Second operand 6 states. [2019-12-18 20:50:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:38,776 INFO L93 Difference]: Finished difference Result 15076 states and 47261 transitions. [2019-12-18 20:50:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:38,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 20:50:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:38,800 INFO L225 Difference]: With dead ends: 15076 [2019-12-18 20:50:38,800 INFO L226 Difference]: Without dead ends: 14937 [2019-12-18 20:50:38,801 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 20:50:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14937 states. [2019-12-18 20:50:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14937 to 14061. [2019-12-18 20:50:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14061 states. [2019-12-18 20:50:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14061 states to 14061 states and 44408 transitions. [2019-12-18 20:50:39,011 INFO L78 Accepts]: Start accepts. Automaton has 14061 states and 44408 transitions. Word has length 41 [2019-12-18 20:50:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:39,012 INFO L462 AbstractCegarLoop]: Abstraction has 14061 states and 44408 transitions. [2019-12-18 20:50:39,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 14061 states and 44408 transitions. [2019-12-18 20:50:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:39,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:39,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:39,027 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -381420262, now seen corresponding path program 1 times [2019-12-18 20:50:39,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:39,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298056588] [2019-12-18 20:50:39,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:39,084 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 20:50:39,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298056588] [2019-12-18 20:50:39,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:39,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:39,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179317569] [2019-12-18 20:50:39,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:39,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:39,086 INFO L87 Difference]: Start difference. First operand 14061 states and 44408 transitions. Second operand 4 states. [2019-12-18 20:50:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:39,201 INFO L93 Difference]: Finished difference Result 25391 states and 80145 transitions. [2019-12-18 20:50:39,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:39,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 20:50:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:39,225 INFO L225 Difference]: With dead ends: 25391 [2019-12-18 20:50:39,225 INFO L226 Difference]: Without dead ends: 11784 [2019-12-18 20:50:39,225 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 20:50:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11784 states. [2019-12-18 20:50:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11784 to 11784. [2019-12-18 20:50:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11784 states. [2019-12-18 20:50:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11784 states to 11784 states and 36963 transitions. [2019-12-18 20:50:39,417 INFO L78 Accepts]: Start accepts. Automaton has 11784 states and 36963 transitions. Word has length 56 [2019-12-18 20:50:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:39,418 INFO L462 AbstractCegarLoop]: Abstraction has 11784 states and 36963 transitions. [2019-12-18 20:50:39,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 11784 states and 36963 transitions. [2019-12-18 20:50:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:39,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:39,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:39,431 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2143781782, now seen corresponding path program 2 times [2019-12-18 20:50:39,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:39,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411364134] [2019-12-18 20:50:39,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:40,201 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 20:50:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411364134] [2019-12-18 20:50:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:40,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:50:40,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287347231] [2019-12-18 20:50:40,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:50:40,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:50:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:50:40,204 INFO L87 Difference]: Start difference. First operand 11784 states and 36963 transitions. Second operand 17 states. [2019-12-18 20:50:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:47,397 INFO L93 Difference]: Finished difference Result 31244 states and 95678 transitions. [2019-12-18 20:50:47,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 20:50:47,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 20:50:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:47,428 INFO L225 Difference]: With dead ends: 31244 [2019-12-18 20:50:47,428 INFO L226 Difference]: Without dead ends: 19501 [2019-12-18 20:50:47,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=500, Invalid=2256, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 20:50:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19501 states. [2019-12-18 20:50:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19501 to 13624. [2019-12-18 20:50:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13624 states. [2019-12-18 20:50:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13624 states to 13624 states and 42540 transitions. [2019-12-18 20:50:47,659 INFO L78 Accepts]: Start accepts. Automaton has 13624 states and 42540 transitions. Word has length 56 [2019-12-18 20:50:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:47,660 INFO L462 AbstractCegarLoop]: Abstraction has 13624 states and 42540 transitions. [2019-12-18 20:50:47,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:50:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 13624 states and 42540 transitions. [2019-12-18 20:50:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:47,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:47,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:47,674 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1014055824, now seen corresponding path program 3 times [2019-12-18 20:50:47,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:47,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35020650] [2019-12-18 20:50:47,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:48,248 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 20:50:48,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35020650] [2019-12-18 20:50:48,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:48,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:50:48,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147515003] [2019-12-18 20:50:48,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:50:48,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:50:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:50:48,250 INFO L87 Difference]: Start difference. First operand 13624 states and 42540 transitions. Second operand 18 states. [2019-12-18 20:50:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:52,840 INFO L93 Difference]: Finished difference Result 27085 states and 82918 transitions. [2019-12-18 20:50:52,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 20:50:52,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-18 20:50:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:52,869 INFO L225 Difference]: With dead ends: 27085 [2019-12-18 20:50:52,869 INFO L226 Difference]: Without dead ends: 20143 [2019-12-18 20:50:52,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=568, Invalid=2624, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 20:50:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20143 states. [2019-12-18 20:50:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20143 to 13828. [2019-12-18 20:50:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13828 states. [2019-12-18 20:50:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13828 states to 13828 states and 43148 transitions. [2019-12-18 20:50:53,098 INFO L78 Accepts]: Start accepts. Automaton has 13828 states and 43148 transitions. Word has length 56 [2019-12-18 20:50:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:53,098 INFO L462 AbstractCegarLoop]: Abstraction has 13828 states and 43148 transitions. [2019-12-18 20:50:53,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:50:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13828 states and 43148 transitions. [2019-12-18 20:50:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:53,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:53,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:53,114 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 727818828, now seen corresponding path program 4 times [2019-12-18 20:50:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:53,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277033410] [2019-12-18 20:50:53,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:53,638 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 20:50:53,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277033410] [2019-12-18 20:50:53,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:53,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:50:53,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726515025] [2019-12-18 20:50:53,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:50:53,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:53,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:50:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:50:53,639 INFO L87 Difference]: Start difference. First operand 13828 states and 43148 transitions. Second operand 16 states. [2019-12-18 20:50:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:58,694 INFO L93 Difference]: Finished difference Result 27412 states and 84150 transitions. [2019-12-18 20:50:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 20:50:58,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:50:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:58,724 INFO L225 Difference]: With dead ends: 27412 [2019-12-18 20:50:58,724 INFO L226 Difference]: Without dead ends: 20579 [2019-12-18 20:50:58,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 20:50:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20579 states. [2019-12-18 20:50:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20579 to 14290. [2019-12-18 20:50:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14290 states. [2019-12-18 20:50:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14290 states to 14290 states and 44200 transitions. [2019-12-18 20:50:58,954 INFO L78 Accepts]: Start accepts. Automaton has 14290 states and 44200 transitions. Word has length 56 [2019-12-18 20:50:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:58,954 INFO L462 AbstractCegarLoop]: Abstraction has 14290 states and 44200 transitions. [2019-12-18 20:50:58,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:50:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14290 states and 44200 transitions. [2019-12-18 20:50:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:50:58,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:58,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:58,968 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:50:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -626629072, now seen corresponding path program 5 times [2019-12-18 20:50:58,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:58,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405583614] [2019-12-18 20:50:58,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:59,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405583614] [2019-12-18 20:50:59,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:50:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992889304] [2019-12-18 20:50:59,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:50:59,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:50:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:50:59,592 INFO L87 Difference]: Start difference. First operand 14290 states and 44200 transitions. Second operand 17 states. [2019-12-18 20:51:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:03,666 INFO L93 Difference]: Finished difference Result 22855 states and 69600 transitions. [2019-12-18 20:51:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 20:51:03,666 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 20:51:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:03,696 INFO L225 Difference]: With dead ends: 22855 [2019-12-18 20:51:03,696 INFO L226 Difference]: Without dead ends: 20813 [2019-12-18 20:51:03,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 20:51:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20813 states. [2019-12-18 20:51:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20813 to 14374. [2019-12-18 20:51:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14374 states. [2019-12-18 20:51:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14374 states to 14374 states and 44416 transitions. [2019-12-18 20:51:04,109 INFO L78 Accepts]: Start accepts. Automaton has 14374 states and 44416 transitions. Word has length 56 [2019-12-18 20:51:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:04,109 INFO L462 AbstractCegarLoop]: Abstraction has 14374 states and 44416 transitions. [2019-12-18 20:51:04,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:51:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14374 states and 44416 transitions. [2019-12-18 20:51:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:04,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:04,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:04,128 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash -942324032, now seen corresponding path program 6 times [2019-12-18 20:51:04,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:04,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736466263] [2019-12-18 20:51:04,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:04,735 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 20:51:04,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736466263] [2019-12-18 20:51:04,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:04,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:51:04,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367240111] [2019-12-18 20:51:04,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:51:04,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:51:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:51:04,739 INFO L87 Difference]: Start difference. First operand 14374 states and 44416 transitions. Second operand 16 states. [2019-12-18 20:51:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:07,898 INFO L93 Difference]: Finished difference Result 22223 states and 67896 transitions. [2019-12-18 20:51:07,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 20:51:07,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:51:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:07,928 INFO L225 Difference]: With dead ends: 22223 [2019-12-18 20:51:07,928 INFO L226 Difference]: Without dead ends: 20833 [2019-12-18 20:51:07,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 20:51:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-18 20:51:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 14212. [2019-12-18 20:51:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14212 states. [2019-12-18 20:51:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14212 states to 14212 states and 43966 transitions. [2019-12-18 20:51:08,165 INFO L78 Accepts]: Start accepts. Automaton has 14212 states and 43966 transitions. Word has length 56 [2019-12-18 20:51:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:08,166 INFO L462 AbstractCegarLoop]: Abstraction has 14212 states and 43966 transitions. [2019-12-18 20:51:08,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:51:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14212 states and 43966 transitions. [2019-12-18 20:51:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:08,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:08,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:08,181 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 703526588, now seen corresponding path program 7 times [2019-12-18 20:51:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:08,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570038448] [2019-12-18 20:51:08,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:08,895 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 20:51:08,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570038448] [2019-12-18 20:51:08,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:51:08,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093735962] [2019-12-18 20:51:08,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:51:08,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:51:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:51:08,897 INFO L87 Difference]: Start difference. First operand 14212 states and 43966 transitions. Second operand 19 states. [2019-12-18 20:51:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:18,520 INFO L93 Difference]: Finished difference Result 24107 states and 73349 transitions. [2019-12-18 20:51:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-18 20:51:18,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 20:51:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:18,552 INFO L225 Difference]: With dead ends: 24107 [2019-12-18 20:51:18,552 INFO L226 Difference]: Without dead ends: 23229 [2019-12-18 20:51:18,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4105 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1243, Invalid=10313, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 20:51:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23229 states. [2019-12-18 20:51:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23229 to 15172. [2019-12-18 20:51:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15172 states. [2019-12-18 20:51:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15172 states to 15172 states and 46874 transitions. [2019-12-18 20:51:18,811 INFO L78 Accepts]: Start accepts. Automaton has 15172 states and 46874 transitions. Word has length 56 [2019-12-18 20:51:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:18,811 INFO L462 AbstractCegarLoop]: Abstraction has 15172 states and 46874 transitions. [2019-12-18 20:51:18,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:51:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 15172 states and 46874 transitions. [2019-12-18 20:51:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:18,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:18,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:18,827 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 217266700, now seen corresponding path program 8 times [2019-12-18 20:51:18,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:18,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104532537] [2019-12-18 20:51:18,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:19,530 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 20:51:19,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104532537] [2019-12-18 20:51:19,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:19,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:51:19,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205603670] [2019-12-18 20:51:19,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:51:19,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:19,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:51:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:51:19,532 INFO L87 Difference]: Start difference. First operand 15172 states and 46874 transitions. Second operand 19 states. [2019-12-18 20:51:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:28,452 INFO L93 Difference]: Finished difference Result 24991 states and 75812 transitions. [2019-12-18 20:51:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-18 20:51:28,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 20:51:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:28,485 INFO L225 Difference]: With dead ends: 24991 [2019-12-18 20:51:28,486 INFO L226 Difference]: Without dead ends: 21814 [2019-12-18 20:51:28,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1194, Invalid=8118, Unknown=0, NotChecked=0, Total=9312 [2019-12-18 20:51:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21814 states. [2019-12-18 20:51:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21814 to 14407. [2019-12-18 20:51:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14407 states. [2019-12-18 20:51:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 44496 transitions. [2019-12-18 20:51:28,744 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 44496 transitions. Word has length 56 [2019-12-18 20:51:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:28,744 INFO L462 AbstractCegarLoop]: Abstraction has 14407 states and 44496 transitions. [2019-12-18 20:51:28,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:51:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 44496 transitions. [2019-12-18 20:51:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:28,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:28,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:28,761 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1651590828, now seen corresponding path program 9 times [2019-12-18 20:51:28,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:28,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962380064] [2019-12-18 20:51:28,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:29,075 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-12-18 20:51:29,768 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 20:51:29,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962380064] [2019-12-18 20:51:29,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:29,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:51:29,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999376202] [2019-12-18 20:51:29,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:51:29,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:51:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:51:29,770 INFO L87 Difference]: Start difference. First operand 14407 states and 44496 transitions. Second operand 17 states. [2019-12-18 20:51:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:32,652 INFO L93 Difference]: Finished difference Result 21662 states and 65843 transitions. [2019-12-18 20:51:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 20:51:32,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 20:51:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:32,682 INFO L225 Difference]: With dead ends: 21662 [2019-12-18 20:51:32,682 INFO L226 Difference]: Without dead ends: 20472 [2019-12-18 20:51:32,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 20:51:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20472 states. [2019-12-18 20:51:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20472 to 14427. [2019-12-18 20:51:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14427 states. [2019-12-18 20:51:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14427 states to 14427 states and 44548 transitions. [2019-12-18 20:51:32,918 INFO L78 Accepts]: Start accepts. Automaton has 14427 states and 44548 transitions. Word has length 56 [2019-12-18 20:51:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:32,918 INFO L462 AbstractCegarLoop]: Abstraction has 14427 states and 44548 transitions. [2019-12-18 20:51:32,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:51:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14427 states and 44548 transitions. [2019-12-18 20:51:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:32,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:32,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:32,932 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash 495448748, now seen corresponding path program 10 times [2019-12-18 20:51:32,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:32,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009042528] [2019-12-18 20:51:32,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:33,498 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 20:51:33,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009042528] [2019-12-18 20:51:33,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:33,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:51:33,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471959248] [2019-12-18 20:51:33,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:51:33,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:51:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:51:33,499 INFO L87 Difference]: Start difference. First operand 14427 states and 44548 transitions. Second operand 17 states. [2019-12-18 20:51:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:37,382 INFO L93 Difference]: Finished difference Result 21704 states and 65938 transitions. [2019-12-18 20:51:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 20:51:37,382 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 20:51:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:37,411 INFO L225 Difference]: With dead ends: 21704 [2019-12-18 20:51:37,412 INFO L226 Difference]: Without dead ends: 21022 [2019-12-18 20:51:37,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 20:51:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21022 states. [2019-12-18 20:51:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21022 to 14499. [2019-12-18 20:51:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14499 states. [2019-12-18 20:51:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14499 states to 14499 states and 44726 transitions. [2019-12-18 20:51:37,826 INFO L78 Accepts]: Start accepts. Automaton has 14499 states and 44726 transitions. Word has length 56 [2019-12-18 20:51:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:37,826 INFO L462 AbstractCegarLoop]: Abstraction has 14499 states and 44726 transitions. [2019-12-18 20:51:37,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:51:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14499 states and 44726 transitions. [2019-12-18 20:51:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:37,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:37,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:37,841 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1615103488, now seen corresponding path program 11 times [2019-12-18 20:51:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083330463] [2019-12-18 20:51:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:38,411 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 20:51:38,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083330463] [2019-12-18 20:51:38,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:38,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:51:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372887879] [2019-12-18 20:51:38,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:51:38,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:51:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:51:38,413 INFO L87 Difference]: Start difference. First operand 14499 states and 44726 transitions. Second operand 16 states. [2019-12-18 20:51:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:41,980 INFO L93 Difference]: Finished difference Result 21688 states and 65946 transitions. [2019-12-18 20:51:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:51:41,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:51:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:42,010 INFO L225 Difference]: With dead ends: 21688 [2019-12-18 20:51:42,011 INFO L226 Difference]: Without dead ends: 21042 [2019-12-18 20:51:42,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 20:51:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21042 states. [2019-12-18 20:51:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21042 to 14531. [2019-12-18 20:51:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14531 states. [2019-12-18 20:51:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14531 states to 14531 states and 44814 transitions. [2019-12-18 20:51:42,249 INFO L78 Accepts]: Start accepts. Automaton has 14531 states and 44814 transitions. Word has length 56 [2019-12-18 20:51:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:42,249 INFO L462 AbstractCegarLoop]: Abstraction has 14531 states and 44814 transitions. [2019-12-18 20:51:42,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:51:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14531 states and 44814 transitions. [2019-12-18 20:51:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:42,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:42,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:42,265 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1034013188, now seen corresponding path program 12 times [2019-12-18 20:51:42,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:42,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957077411] [2019-12-18 20:51:42,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:42,943 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 20:51:42,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957077411] [2019-12-18 20:51:42,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:42,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 20:51:42,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368923460] [2019-12-18 20:51:42,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 20:51:42,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 20:51:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:51:42,945 INFO L87 Difference]: Start difference. First operand 14531 states and 44814 transitions. Second operand 20 states. [2019-12-18 20:51:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:51,634 INFO L93 Difference]: Finished difference Result 21495 states and 65399 transitions. [2019-12-18 20:51:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-18 20:51:51,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 20:51:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:51,667 INFO L225 Difference]: With dead ends: 21495 [2019-12-18 20:51:51,668 INFO L226 Difference]: Without dead ends: 21297 [2019-12-18 20:51:51,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=726, Invalid=5126, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 20:51:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21297 states. [2019-12-18 20:51:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21297 to 14700. [2019-12-18 20:51:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14700 states. [2019-12-18 20:51:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14700 states to 14700 states and 45262 transitions. [2019-12-18 20:51:51,913 INFO L78 Accepts]: Start accepts. Automaton has 14700 states and 45262 transitions. Word has length 56 [2019-12-18 20:51:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:51,913 INFO L462 AbstractCegarLoop]: Abstraction has 14700 states and 45262 transitions. [2019-12-18 20:51:51,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 20:51:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 14700 states and 45262 transitions. [2019-12-18 20:51:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:51,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:51,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:51,929 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1520273076, now seen corresponding path program 13 times [2019-12-18 20:51:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:51,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474445560] [2019-12-18 20:51:51,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:52,608 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 20:51:52,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474445560] [2019-12-18 20:51:52,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:52,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 20:51:52,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860735238] [2019-12-18 20:51:52,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 20:51:52,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:52,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 20:51:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:51:52,610 INFO L87 Difference]: Start difference. First operand 14700 states and 45262 transitions. Second operand 20 states. [2019-12-18 20:51:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:59,395 INFO L93 Difference]: Finished difference Result 22321 states and 67769 transitions. [2019-12-18 20:51:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-18 20:51:59,396 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 20:51:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:59,427 INFO L225 Difference]: With dead ends: 22321 [2019-12-18 20:51:59,427 INFO L226 Difference]: Without dead ends: 21827 [2019-12-18 20:51:59,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=804, Invalid=5048, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 20:51:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21827 states. [2019-12-18 20:51:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21827 to 14410. [2019-12-18 20:51:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14410 states. [2019-12-18 20:51:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14410 states to 14410 states and 44503 transitions. [2019-12-18 20:51:59,675 INFO L78 Accepts]: Start accepts. Automaton has 14410 states and 44503 transitions. Word has length 56 [2019-12-18 20:51:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:59,675 INFO L462 AbstractCegarLoop]: Abstraction has 14410 states and 44503 transitions. [2019-12-18 20:51:59,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 20:51:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 14410 states and 44503 transitions. [2019-12-18 20:51:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:51:59,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:59,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:51:59,690 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:51:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 413244938, now seen corresponding path program 14 times [2019-12-18 20:51:59,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:59,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971637877] [2019-12-18 20:51:59,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:00,318 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 20:52:00,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971637877] [2019-12-18 20:52:00,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:00,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:52:00,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526856450] [2019-12-18 20:52:00,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:52:00,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:52:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:52:00,320 INFO L87 Difference]: Start difference. First operand 14410 states and 44503 transitions. Second operand 18 states. [2019-12-18 20:52:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:04,223 INFO L93 Difference]: Finished difference Result 21108 states and 64184 transitions. [2019-12-18 20:52:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 20:52:04,224 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-18 20:52:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:04,253 INFO L225 Difference]: With dead ends: 21108 [2019-12-18 20:52:04,253 INFO L226 Difference]: Without dead ends: 20398 [2019-12-18 20:52:04,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 20:52:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20398 states. [2019-12-18 20:52:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20398 to 14478. [2019-12-18 20:52:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14478 states. [2019-12-18 20:52:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14478 states to 14478 states and 44688 transitions. [2019-12-18 20:52:04,488 INFO L78 Accepts]: Start accepts. Automaton has 14478 states and 44688 transitions. Word has length 56 [2019-12-18 20:52:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:04,488 INFO L462 AbstractCegarLoop]: Abstraction has 14478 states and 44688 transitions. [2019-12-18 20:52:04,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:52:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14478 states and 44688 transitions. [2019-12-18 20:52:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:04,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:04,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:04,503 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1813617452, now seen corresponding path program 15 times [2019-12-18 20:52:04,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:04,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668512728] [2019-12-18 20:52:04,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:04,999 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 20:52:04,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668512728] [2019-12-18 20:52:04,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:04,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:52:05,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426784787] [2019-12-18 20:52:05,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:52:05,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:52:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:52:05,000 INFO L87 Difference]: Start difference. First operand 14478 states and 44688 transitions. Second operand 19 states. [2019-12-18 20:52:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:08,586 INFO L93 Difference]: Finished difference Result 19616 states and 60071 transitions. [2019-12-18 20:52:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 20:52:08,587 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 20:52:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:08,616 INFO L225 Difference]: With dead ends: 19616 [2019-12-18 20:52:08,616 INFO L226 Difference]: Without dead ends: 19220 [2019-12-18 20:52:08,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 20:52:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19220 states. [2019-12-18 20:52:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19220 to 14524. [2019-12-18 20:52:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14524 states. [2019-12-18 20:52:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14524 states to 14524 states and 44805 transitions. [2019-12-18 20:52:08,850 INFO L78 Accepts]: Start accepts. Automaton has 14524 states and 44805 transitions. Word has length 56 [2019-12-18 20:52:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:08,851 INFO L462 AbstractCegarLoop]: Abstraction has 14524 states and 44805 transitions. [2019-12-18 20:52:08,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:52:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 14524 states and 44805 transitions. [2019-12-18 20:52:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:08,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:08,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:08,867 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:08,867 INFO L82 PathProgramCache]: Analyzing trace with hash -347819822, now seen corresponding path program 16 times [2019-12-18 20:52:08,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:08,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801056123] [2019-12-18 20:52:08,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:09,366 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 20:52:09,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801056123] [2019-12-18 20:52:09,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:09,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:52:09,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877215957] [2019-12-18 20:52:09,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:52:09,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:52:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:52:09,368 INFO L87 Difference]: Start difference. First operand 14524 states and 44805 transitions. Second operand 19 states. [2019-12-18 20:52:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:15,865 INFO L93 Difference]: Finished difference Result 25827 states and 77949 transitions. [2019-12-18 20:52:15,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-18 20:52:15,866 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 20:52:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:15,896 INFO L225 Difference]: With dead ends: 25827 [2019-12-18 20:52:15,896 INFO L226 Difference]: Without dead ends: 21470 [2019-12-18 20:52:15,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2381 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=867, Invalid=6615, Unknown=0, NotChecked=0, Total=7482 [2019-12-18 20:52:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21470 states. [2019-12-18 20:52:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21470 to 14634. [2019-12-18 20:52:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14634 states. [2019-12-18 20:52:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 45139 transitions. [2019-12-18 20:52:16,148 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 45139 transitions. Word has length 56 [2019-12-18 20:52:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:16,148 INFO L462 AbstractCegarLoop]: Abstraction has 14634 states and 45139 transitions. [2019-12-18 20:52:16,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:52:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 45139 transitions. [2019-12-18 20:52:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:16,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:16,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:16,164 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1524860990, now seen corresponding path program 17 times [2019-12-18 20:52:16,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:16,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537576682] [2019-12-18 20:52:16,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:16,855 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 20:52:16,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537576682] [2019-12-18 20:52:16,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:16,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:52:16,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790295089] [2019-12-18 20:52:16,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:52:16,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:52:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:52:16,857 INFO L87 Difference]: Start difference. First operand 14634 states and 45139 transitions. Second operand 17 states. [2019-12-18 20:52:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:20,375 INFO L93 Difference]: Finished difference Result 21086 states and 64305 transitions. [2019-12-18 20:52:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 20:52:20,375 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 20:52:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:20,406 INFO L225 Difference]: With dead ends: 21086 [2019-12-18 20:52:20,406 INFO L226 Difference]: Without dead ends: 19908 [2019-12-18 20:52:20,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 20:52:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19908 states. [2019-12-18 20:52:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19908 to 14634. [2019-12-18 20:52:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14634 states. [2019-12-18 20:52:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 45139 transitions. [2019-12-18 20:52:20,646 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 45139 transitions. Word has length 56 [2019-12-18 20:52:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:20,646 INFO L462 AbstractCegarLoop]: Abstraction has 14634 states and 45139 transitions. [2019-12-18 20:52:20,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:52:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 45139 transitions. [2019-12-18 20:52:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:20,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:20,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:20,665 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:20,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash 368718910, now seen corresponding path program 18 times [2019-12-18 20:52:20,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:20,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430560583] [2019-12-18 20:52:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:21,528 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 20:52:21,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430560583] [2019-12-18 20:52:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:21,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 20:52:21,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740695878] [2019-12-18 20:52:21,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 20:52:21,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 20:52:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:52:21,529 INFO L87 Difference]: Start difference. First operand 14634 states and 45139 transitions. Second operand 19 states. [2019-12-18 20:52:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:26,405 INFO L93 Difference]: Finished difference Result 21544 states and 65545 transitions. [2019-12-18 20:52:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 20:52:26,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-18 20:52:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:26,435 INFO L225 Difference]: With dead ends: 21544 [2019-12-18 20:52:26,436 INFO L226 Difference]: Without dead ends: 20862 [2019-12-18 20:52:26,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 20:52:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20862 states. [2019-12-18 20:52:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20862 to 14706. [2019-12-18 20:52:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-12-18 20:52:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 45317 transitions. [2019-12-18 20:52:26,679 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 45317 transitions. Word has length 56 [2019-12-18 20:52:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:26,679 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 45317 transitions. [2019-12-18 20:52:26,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 20:52:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 45317 transitions. [2019-12-18 20:52:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:26,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:26,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:26,695 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1488373650, now seen corresponding path program 19 times [2019-12-18 20:52:26,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:26,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778317196] [2019-12-18 20:52:26,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:27,285 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 20:52:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778317196] [2019-12-18 20:52:27,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:27,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:52:27,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296062498] [2019-12-18 20:52:27,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:52:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:52:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:52:27,286 INFO L87 Difference]: Start difference. First operand 14706 states and 45317 transitions. Second operand 18 states. [2019-12-18 20:52:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:31,280 INFO L93 Difference]: Finished difference Result 21536 states and 65575 transitions. [2019-12-18 20:52:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 20:52:31,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-18 20:52:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:31,310 INFO L225 Difference]: With dead ends: 21536 [2019-12-18 20:52:31,310 INFO L226 Difference]: Without dead ends: 20890 [2019-12-18 20:52:31,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 20:52:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20890 states. [2019-12-18 20:52:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20890 to 14738. [2019-12-18 20:52:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14738 states. [2019-12-18 20:52:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14738 states to 14738 states and 45405 transitions. [2019-12-18 20:52:31,550 INFO L78 Accepts]: Start accepts. Automaton has 14738 states and 45405 transitions. Word has length 56 [2019-12-18 20:52:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:31,551 INFO L462 AbstractCegarLoop]: Abstraction has 14738 states and 45405 transitions. [2019-12-18 20:52:31,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:52:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 14738 states and 45405 transitions. [2019-12-18 20:52:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:31,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:31,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:31,566 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1160743026, now seen corresponding path program 20 times [2019-12-18 20:52:31,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:31,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739294056] [2019-12-18 20:52:31,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:31,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739294056] [2019-12-18 20:52:31,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:31,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:52:31,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882415083] [2019-12-18 20:52:31,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:52:31,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:52:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:52:31,927 INFO L87 Difference]: Start difference. First operand 14738 states and 45405 transitions. Second operand 16 states. [2019-12-18 20:52:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:37,842 INFO L93 Difference]: Finished difference Result 28065 states and 85529 transitions. [2019-12-18 20:52:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 20:52:37,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:52:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:37,880 INFO L225 Difference]: With dead ends: 28065 [2019-12-18 20:52:37,880 INFO L226 Difference]: Without dead ends: 25353 [2019-12-18 20:52:37,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=751, Invalid=4651, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 20:52:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25353 states. [2019-12-18 20:52:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25353 to 18378. [2019-12-18 20:52:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18378 states. [2019-12-18 20:52:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18378 states to 18378 states and 56210 transitions. [2019-12-18 20:52:38,185 INFO L78 Accepts]: Start accepts. Automaton has 18378 states and 56210 transitions. Word has length 56 [2019-12-18 20:52:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:38,185 INFO L462 AbstractCegarLoop]: Abstraction has 18378 states and 56210 transitions. [2019-12-18 20:52:38,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:52:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 18378 states and 56210 transitions. [2019-12-18 20:52:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:38,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:38,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:38,205 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1647002914, now seen corresponding path program 21 times [2019-12-18 20:52:38,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:38,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897835787] [2019-12-18 20:52:38,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:38,539 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 20:52:38,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897835787] [2019-12-18 20:52:38,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:38,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:52:38,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924937885] [2019-12-18 20:52:38,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:52:38,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:52:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:52:38,541 INFO L87 Difference]: Start difference. First operand 18378 states and 56210 transitions. Second operand 16 states. [2019-12-18 20:52:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:43,082 INFO L93 Difference]: Finished difference Result 27960 states and 85072 transitions. [2019-12-18 20:52:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 20:52:43,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:52:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:43,112 INFO L225 Difference]: With dead ends: 27960 [2019-12-18 20:52:43,112 INFO L226 Difference]: Without dead ends: 19266 [2019-12-18 20:52:43,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=2118, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 20:52:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19266 states. [2019-12-18 20:52:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19266 to 14252. [2019-12-18 20:52:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14252 states. [2019-12-18 20:52:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14252 states to 14252 states and 43825 transitions. [2019-12-18 20:52:43,349 INFO L78 Accepts]: Start accepts. Automaton has 14252 states and 43825 transitions. Word has length 56 [2019-12-18 20:52:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:43,349 INFO L462 AbstractCegarLoop]: Abstraction has 14252 states and 43825 transitions. [2019-12-18 20:52:43,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:52:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14252 states and 43825 transitions. [2019-12-18 20:52:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:43,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:43,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:43,365 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1537179348, now seen corresponding path program 22 times [2019-12-18 20:52:43,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:43,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643764273] [2019-12-18 20:52:43,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:43,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643764273] [2019-12-18 20:52:43,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:43,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:52:43,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400779473] [2019-12-18 20:52:43,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:52:43,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:52:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:52:43,478 INFO L87 Difference]: Start difference. First operand 14252 states and 43825 transitions. Second operand 9 states. [2019-12-18 20:52:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:44,777 INFO L93 Difference]: Finished difference Result 26588 states and 81984 transitions. [2019-12-18 20:52:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:52:44,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 20:52:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:44,808 INFO L225 Difference]: With dead ends: 26588 [2019-12-18 20:52:44,808 INFO L226 Difference]: Without dead ends: 20358 [2019-12-18 20:52:44,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:52:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-18 20:52:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 14771. [2019-12-18 20:52:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2019-12-18 20:52:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 45549 transitions. [2019-12-18 20:52:45,058 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 45549 transitions. Word has length 56 [2019-12-18 20:52:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:52:45,058 INFO L462 AbstractCegarLoop]: Abstraction has 14771 states and 45549 transitions. [2019-12-18 20:52:45,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:52:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 45549 transitions. [2019-12-18 20:52:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:52:45,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:45,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:45,075 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash -548865040, now seen corresponding path program 23 times [2019-12-18 20:52:45,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:45,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050687129] [2019-12-18 20:52:45,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:52:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:52:45,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:52:45,171 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:52:45,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t672~0.base_27|)) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~x$r_buff0_thd0~0_21) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~x$r_buff1_thd0~0_23 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t672~0.base_27| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t672~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t672~0.base_27|) |v_ULTIMATE.start_main_~#t672~0.offset_21| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= v_~x$flush_delayed~0_12 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~x~0_22 0) (= 0 v_~x$w_buff0_used~0_115) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd2~0_25) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_31) (= |v_ULTIMATE.start_main_~#t672~0.offset_21| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t672~0.base_27| 4)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t672~0.base_27|) (= v_~x$w_buff1_used~0_68 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t674~0.base=|v_ULTIMATE.start_main_~#t674~0.base_26|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t674~0.offset=|v_ULTIMATE.start_main_~#t674~0.offset_20|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t672~0.base=|v_ULTIMATE.start_main_~#t672~0.base_27|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t673~0.offset=|v_ULTIMATE.start_main_~#t673~0.offset_20|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115, ULTIMATE.start_main_~#t673~0.base=|v_ULTIMATE.start_main_~#t673~0.base_26|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ULTIMATE.start_main_~#t672~0.offset=|v_ULTIMATE.start_main_~#t672~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t674~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t674~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t672~0.base, #NULL.base, ULTIMATE.start_main_~#t673~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t673~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t672~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:52:45,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-1-->L823: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t673~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t673~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t673~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t673~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t673~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t673~0.base_13|) |v_ULTIMATE.start_main_~#t673~0.offset_11| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t673~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t673~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t673~0.base=|v_ULTIMATE.start_main_~#t673~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t673~0.offset=|v_ULTIMATE.start_main_~#t673~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t673~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t673~0.offset] because there is no mapped edge [2019-12-18 20:52:45,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L823-1-->L825: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t674~0.base_12|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t674~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t674~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t674~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t674~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t674~0.base_12|) |v_ULTIMATE.start_main_~#t674~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t674~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t674~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t674~0.offset=|v_ULTIMATE.start_main_~#t674~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t674~0.base=|v_ULTIMATE.start_main_~#t674~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t674~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t674~0.base] because there is no mapped edge [2019-12-18 20:52:45,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_14) (= 1 v_~x$w_buff0_used~0_72) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_73) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:52:45,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L798-2-->L798-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-267487408 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-267487408 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-267487408| ~x~0_In-267487408) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-267487408| ~x$w_buff1~0_In-267487408)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-267487408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-267487408, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-267487408, ~x~0=~x~0_In-267487408} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-267487408|, ~x$w_buff1~0=~x$w_buff1~0_In-267487408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-267487408, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-267487408, ~x~0=~x~0_In-267487408} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:52:45,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L798-4-->L799: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 20:52:45,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1339709422 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1339709422 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1339709422|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1339709422 |P2Thread1of1ForFork1_#t~ite34_Out-1339709422|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1339709422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1339709422} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1339709422|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1339709422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1339709422} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:52:45,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1481117540 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1481117540 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1481117540 |P1Thread1of1ForFork0_#t~ite28_Out1481117540|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1481117540|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1481117540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1481117540} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1481117540, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1481117540|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1481117540} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:52:45,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-569224287 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-569224287 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-569224287 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-569224287 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-569224287| ~x$w_buff1_used~0_In-569224287) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-569224287|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-569224287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-569224287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-569224287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-569224287} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-569224287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-569224287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-569224287, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-569224287|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-569224287} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:52:45,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1395351938 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-1395351938| |P0Thread1of1ForFork2_#t~ite8_Out-1395351938|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1395351938| ~x$w_buff0~0_In-1395351938) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1395351938 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1395351938 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1395351938 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1395351938 256) 0)))) (= ~x$w_buff0~0_In-1395351938 |P0Thread1of1ForFork2_#t~ite8_Out-1395351938|) (= |P0Thread1of1ForFork2_#t~ite9_Out-1395351938| |P0Thread1of1ForFork2_#t~ite8_Out-1395351938|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1395351938, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1395351938, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1395351938|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1395351938, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1395351938, ~weak$$choice2~0=~weak$$choice2~0_In-1395351938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1395351938} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1395351938, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1395351938, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1395351938|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1395351938, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1395351938|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1395351938, ~weak$$choice2~0=~weak$$choice2~0_In-1395351938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1395351938} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:52:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In103202863 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In103202863 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out103202863 ~x$r_buff0_thd2~0_In103202863)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out103202863 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In103202863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In103202863} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out103202863|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out103202863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In103202863} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:52:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-972684303 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-972684303 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-972684303 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-972684303 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-972684303| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-972684303| ~x$r_buff1_thd2~0_In-972684303)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-972684303, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-972684303, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-972684303, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-972684303} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-972684303|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-972684303, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-972684303, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-972684303, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-972684303} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:52:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 20:52:45,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1277659841 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1277659841 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1277659841 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1277659841 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1277659841 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite17_Out1277659841| ~x$w_buff1_used~0_In1277659841) (= |P0Thread1of1ForFork2_#t~ite17_Out1277659841| |P0Thread1of1ForFork2_#t~ite18_Out1277659841|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite17_In1277659841| |P0Thread1of1ForFork2_#t~ite17_Out1277659841|) (= |P0Thread1of1ForFork2_#t~ite18_Out1277659841| ~x$w_buff1_used~0_In1277659841)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1277659841, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1277659841|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1277659841, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1277659841, ~weak$$choice2~0=~weak$$choice2~0_In1277659841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277659841} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1277659841, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1277659841|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1277659841|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1277659841, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1277659841, ~weak$$choice2~0=~weak$$choice2~0_In1277659841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1277659841} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 20:52:45,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L744-->L745: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_59 v_~x$r_buff0_thd1~0_60)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:52:45,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse4 (= |P0Thread1of1ForFork2_#t~ite24_Out1065893066| |P0Thread1of1ForFork2_#t~ite23_Out1065893066|)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1065893066 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In1065893066 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1065893066 256) 0)) (.cse5 (= (mod ~x$w_buff0_used~0_In1065893066 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In1065893066 256)))) (or (let ((.cse1 (not .cse6))) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite22_Out1065893066| 0) (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) .cse4 (= |P0Thread1of1ForFork2_#t~ite22_Out1065893066| |P0Thread1of1ForFork2_#t~ite23_Out1065893066|) (not .cse5))) (and (or (and .cse0 (= ~x$r_buff1_thd1~0_In1065893066 |P0Thread1of1ForFork2_#t~ite23_Out1065893066|) .cse4 (or (and .cse6 .cse3) (and .cse6 .cse2) .cse5)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out1065893066| ~x$r_buff1_thd1~0_In1065893066) (= |P0Thread1of1ForFork2_#t~ite23_Out1065893066| |P0Thread1of1ForFork2_#t~ite23_In1065893066|))) (= |P0Thread1of1ForFork2_#t~ite22_In1065893066| |P0Thread1of1ForFork2_#t~ite22_Out1065893066|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1065893066, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065893066, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1065893066, ~weak$$choice2~0=~weak$$choice2~0_In1065893066, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1065893066|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1065893066|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065893066} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1065893066, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065893066, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1065893066, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1065893066|, ~weak$$choice2~0=~weak$$choice2~0_In1065893066, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1065893066|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1065893066|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065893066} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 20:52:45,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (= v_~x$mem_tmp~0_5 v_~x~0_17) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 20:52:45,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In539247548 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In539247548 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In539247548 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In539247548 256) 0))) (or (and (= ~x$w_buff1_used~0_In539247548 |P2Thread1of1ForFork1_#t~ite35_Out539247548|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite35_Out539247548| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In539247548, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In539247548, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In539247548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539247548} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out539247548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In539247548, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In539247548, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In539247548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539247548} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:52:45,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-799617958 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-799617958 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-799617958 |P2Thread1of1ForFork1_#t~ite36_Out-799617958|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-799617958|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-799617958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-799617958} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-799617958|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-799617958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-799617958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:52:45,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-553491657 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-553491657 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-553491657 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-553491657 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-553491657| ~x$r_buff1_thd3~0_In-553491657) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-553491657| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-553491657, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-553491657, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-553491657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-553491657} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-553491657|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-553491657, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-553491657, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-553491657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-553491657} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:52:45,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L802-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:52:45,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L829-->L831-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= (mod v_~x$w_buff0_used~0_83 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:52:45,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-2-->L831-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1841816580 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1841816580 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1841816580| ~x~0_In1841816580) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In1841816580 |ULTIMATE.start_main_#t~ite41_Out1841816580|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1841816580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1841816580, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1841816580, ~x~0=~x~0_In1841816580} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1841816580|, ~x$w_buff1~0=~x$w_buff1~0_In1841816580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1841816580, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1841816580, ~x~0=~x~0_In1841816580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 20:52:45,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L831-4-->L832: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 20:52:45,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1509590425 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1509590425 256)))) (or (and (= ~x$w_buff0_used~0_In-1509590425 |ULTIMATE.start_main_#t~ite43_Out-1509590425|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1509590425|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1509590425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1509590425} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1509590425, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1509590425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1509590425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:52:45,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In499974332 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In499974332 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In499974332 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In499974332 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out499974332| ~x$w_buff1_used~0_In499974332) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out499974332| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In499974332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499974332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In499974332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In499974332} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In499974332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499974332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In499974332, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out499974332|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In499974332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:52:45,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1488613350 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1488613350 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1488613350| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1488613350| ~x$r_buff0_thd0~0_In1488613350) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1488613350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488613350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1488613350, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1488613350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488613350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:52:45,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-644925910 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-644925910 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-644925910 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-644925910 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-644925910| 0)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-644925910 |ULTIMATE.start_main_#t~ite46_Out-644925910|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-644925910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-644925910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-644925910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-644925910} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-644925910, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-644925910|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-644925910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-644925910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-644925910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:52:45,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y~0_10 2) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:52:45,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:52:45 BasicIcfg [2019-12-18 20:52:45,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:52:45,299 INFO L168 Benchmark]: Toolchain (without parser) took 190384.68 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.6 MB in the beginning and 878.7 MB in the end (delta: -778.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,302 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.21 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 157.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.41 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,303 INFO L168 Benchmark]: Boogie Preprocessor took 39.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,303 INFO L168 Benchmark]: RCFGBuilder took 898.31 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,304 INFO L168 Benchmark]: TraceAbstraction took 188582.42 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 105.0 MB in the beginning and 878.7 MB in the end (delta: -773.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 20:52:45,309 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.21 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 157.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.41 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.31 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188582.42 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 105.0 MB in the beginning and 878.7 MB in the end (delta: -773.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6628 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68107 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t672, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t673, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] FCALL, FORK 0 pthread_create(&t674, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 y = 2 [L792] 3 __unbuffered_p2_EAX = y [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L732] 1 z = 1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 188.2s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 126.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10188 SDtfs, 16573 SDslu, 51410 SDs, 0 SdLazy, 90020 SolverSat, 1382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1339 GetRequests, 43 SyntacticMatches, 76 SemanticMatches, 1220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22074 ImplicationChecksByTransitivity, 33.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113136occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 221835 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1778 NumberOfCodeBlocks, 1778 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 693987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...