/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:31:53,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:31:53,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:31:53,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:31:53,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:31:53,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:31:53,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:31:53,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:31:53,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:31:53,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:31:53,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:31:53,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:31:53,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:31:53,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:31:53,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:31:53,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:31:53,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:31:53,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:31:53,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:31:53,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:31:53,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:31:53,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:31:53,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:31:53,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:31:53,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:31:53,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:31:53,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:31:53,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:31:53,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:31:53,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:31:53,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:31:53,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:31:53,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:31:53,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:31:53,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:31:53,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:31:53,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:31:53,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:31:53,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:31:53,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:31:53,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:31:53,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:31:53,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:31:53,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:31:53,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:31:53,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:31:53,876 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:31:53,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:31:53,876 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:31:53,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:31:53,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:31:53,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:31:53,878 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:31:53,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:31:53,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:31:53,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:31:53,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:31:53,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:31:53,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:31:53,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:31:53,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:31:54,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:31:54,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:31:54,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:31:54,243 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:31:54,243 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:31:54,244 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2020-10-05 23:31:54,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dce11c98/4dc9c8c176044326806b45f9cd44291a/FLAG0611e68bc [2020-10-05 23:31:54,896 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:31:54,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i [2020-10-05 23:31:54,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dce11c98/4dc9c8c176044326806b45f9cd44291a/FLAG0611e68bc [2020-10-05 23:31:55,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dce11c98/4dc9c8c176044326806b45f9cd44291a [2020-10-05 23:31:55,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:31:55,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:31:55,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:31:55,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:31:55,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:31:55,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:55,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2505dd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55, skipping insertion in model container [2020-10-05 23:31:55,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:55,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:31:55,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:31:55,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:31:55,787 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:31:55,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:31:55,987 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:31:55,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55 WrapperNode [2020-10-05 23:31:55,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:31:55,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:31:55,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:31:55,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:31:55,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:31:56,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:31:56,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:31:56,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:31:56,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (1/1) ... [2020-10-05 23:31:56,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:31:56,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:31:56,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:31:56,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:31:56,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (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 [2020-10-05 23:31:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:31:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:31:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:31:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:31:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:31:56,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:31:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:31:56,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:31:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:31:56,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:31:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:31:56,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:31:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:31:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:31:56,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:31:56,187 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:31:58,340 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:31:58,340 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:31:58,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:31:58 BoogieIcfgContainer [2020-10-05 23:31:58,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:31:58,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:31:58,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:31:58,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:31:58,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:31:55" (1/3) ... [2020-10-05 23:31:58,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1bc745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:31:58, skipping insertion in model container [2020-10-05 23:31:58,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:31:55" (2/3) ... [2020-10-05 23:31:58,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1bc745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:31:58, skipping insertion in model container [2020-10-05 23:31:58,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:31:58" (3/3) ... [2020-10-05 23:31:58,352 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2020-10-05 23:31:58,364 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:31:58,364 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:31:58,372 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:31:58,373 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:31:58,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,406 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,411 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,411 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,411 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,415 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,415 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,434 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:31:58,453 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:31:58,477 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:31:58,477 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:31:58,478 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:31:58,478 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:31:58,478 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:31:58,478 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:31:58,478 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:31:58,478 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:31:58,497 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-05 23:31:58,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-05 23:31:58,555 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-05 23:31:58,555 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:31:58,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:31:58,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-05 23:31:58,592 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-05 23:31:58,592 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:31:58,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:31:58,597 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2572 [2020-10-05 23:31:58,598 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:32:00,038 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-05 23:32:00,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-05 23:32:00,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:32:00,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 23:32:00,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:32:00,958 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-05 23:32:01,519 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:32:02,412 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:32:03,776 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-05 23:32:04,299 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-05 23:32:04,931 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-05 23:32:05,051 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-05 23:32:06,272 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-05 23:32:06,816 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-05 23:32:06,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6712 [2020-10-05 23:32:06,846 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2020-10-05 23:32:06,850 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-05 23:32:07,085 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-05 23:32:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-05 23:32:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:32:07,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:07,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:07,096 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times [2020-10-05 23:32:07,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:07,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511808537] [2020-10-05 23:32:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:07,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511808537] [2020-10-05 23:32:07,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:07,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:07,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539627770] [2020-10-05 23:32:07,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:07,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:07,462 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-05 23:32:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:07,608 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-05 23:32:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:07,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:32:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:07,655 INFO L225 Difference]: With dead ends: 3250 [2020-10-05 23:32:07,656 INFO L226 Difference]: Without dead ends: 2650 [2020-10-05 23:32:07,657 INFO L675 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 [2020-10-05 23:32:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-05 23:32:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-05 23:32:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-05 23:32:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-05 23:32:07,851 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-05 23:32:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:07,853 INFO L479 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-05 23:32:07,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-05 23:32:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:32:07,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:07,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:07,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:32:07,857 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times [2020-10-05 23:32:07,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:07,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112993762] [2020-10-05 23:32:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:07,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112993762] [2020-10-05 23:32:07,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:07,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:07,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767070844] [2020-10-05 23:32:07,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:07,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:07,995 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-05 23:32:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:08,034 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-05 23:32:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:08,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:32:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:08,130 INFO L225 Difference]: With dead ends: 2610 [2020-10-05 23:32:08,130 INFO L226 Difference]: Without dead ends: 2610 [2020-10-05 23:32:08,131 INFO L675 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 [2020-10-05 23:32:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-05 23:32:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-05 23:32:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-05 23:32:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-05 23:32:08,236 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-10-05 23:32:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:08,237 INFO L479 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-05 23:32:08,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-05 23:32:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:32:08,246 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:08,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:08,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:32:08,247 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1104121036, now seen corresponding path program 1 times [2020-10-05 23:32:08,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:08,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864277390] [2020-10-05 23:32:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:08,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864277390] [2020-10-05 23:32:08,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:08,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:08,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48587068] [2020-10-05 23:32:08,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:08,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:08,348 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-10-05 23:32:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:08,426 INFO L93 Difference]: Finished difference Result 2590 states and 9955 transitions. [2020-10-05 23:32:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:08,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:32:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:08,451 INFO L225 Difference]: With dead ends: 2590 [2020-10-05 23:32:08,452 INFO L226 Difference]: Without dead ends: 2590 [2020-10-05 23:32:08,452 INFO L675 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 [2020-10-05 23:32:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-10-05 23:32:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-10-05 23:32:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-10-05 23:32:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9955 transitions. [2020-10-05 23:32:08,548 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9955 transitions. Word has length 12 [2020-10-05 23:32:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:08,548 INFO L479 AbstractCegarLoop]: Abstraction has 2590 states and 9955 transitions. [2020-10-05 23:32:08,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9955 transitions. [2020-10-05 23:32:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:32:08,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:08,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:08,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:32:08,551 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1798747636, now seen corresponding path program 1 times [2020-10-05 23:32:08,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:08,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571520849] [2020-10-05 23:32:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:08,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571520849] [2020-10-05 23:32:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843821582] [2020-10-05 23:32:08,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:08,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:08,625 INFO L87 Difference]: Start difference. First operand 2590 states and 9955 transitions. Second operand 3 states. [2020-10-05 23:32:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:08,660 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-05 23:32:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:08,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:32:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:08,683 INFO L225 Difference]: With dead ends: 2450 [2020-10-05 23:32:08,683 INFO L226 Difference]: Without dead ends: 2450 [2020-10-05 23:32:08,684 INFO L675 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 [2020-10-05 23:32:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-05 23:32:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-05 23:32:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-05 23:32:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-05 23:32:08,774 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 13 [2020-10-05 23:32:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:08,774 INFO L479 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-05 23:32:08,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-05 23:32:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:32:08,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:08,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:08,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:32:08,777 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:08,778 INFO L82 PathProgramCache]: Analyzing trace with hash -131988125, now seen corresponding path program 1 times [2020-10-05 23:32:08,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:08,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066918137] [2020-10-05 23:32:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:08,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066918137] [2020-10-05 23:32:08,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:08,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:08,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307152627] [2020-10-05 23:32:08,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:08,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:08,868 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-05 23:32:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:08,920 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-10-05 23:32:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:08,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:32:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:08,960 INFO L225 Difference]: With dead ends: 2442 [2020-10-05 23:32:08,961 INFO L226 Difference]: Without dead ends: 2442 [2020-10-05 23:32:08,961 INFO L675 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 [2020-10-05 23:32:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-05 23:32:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-05 23:32:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-05 23:32:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-10-05 23:32:09,048 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 13 [2020-10-05 23:32:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:09,048 INFO L479 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-10-05 23:32:09,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-10-05 23:32:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:32:09,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:09,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:09,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:32:09,052 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times [2020-10-05 23:32:09,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:09,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362065350] [2020-10-05 23:32:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:09,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362065350] [2020-10-05 23:32:09,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:09,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:32:09,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683978503] [2020-10-05 23:32:09,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:09,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:09,125 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states. [2020-10-05 23:32:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:09,249 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-05 23:32:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:09,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:32:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:09,262 INFO L225 Difference]: With dead ends: 2418 [2020-10-05 23:32:09,263 INFO L226 Difference]: Without dead ends: 2418 [2020-10-05 23:32:09,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-05 23:32:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-05 23:32:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-05 23:32:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-05 23:32:09,342 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-10-05 23:32:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:09,343 INFO L479 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-05 23:32:09,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-05 23:32:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:32:09,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:09,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:09,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:32:09,346 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:09,349 INFO L82 PathProgramCache]: Analyzing trace with hash -348629036, now seen corresponding path program 1 times [2020-10-05 23:32:09,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:09,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51859008] [2020-10-05 23:32:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:09,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51859008] [2020-10-05 23:32:09,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:09,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:09,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604898141] [2020-10-05 23:32:09,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:09,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:09,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:09,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:09,394 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 3 states. [2020-10-05 23:32:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:09,417 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-05 23:32:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:09,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-05 23:32:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:09,430 INFO L225 Difference]: With dead ends: 2386 [2020-10-05 23:32:09,430 INFO L226 Difference]: Without dead ends: 2386 [2020-10-05 23:32:09,430 INFO L675 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 [2020-10-05 23:32:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-05 23:32:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-05 23:32:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-05 23:32:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-05 23:32:09,509 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-05 23:32:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:09,509 INFO L479 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-05 23:32:09,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-05 23:32:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:09,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:09,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:09,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:32:09,513 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times [2020-10-05 23:32:09,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:09,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870853626] [2020-10-05 23:32:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:09,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870853626] [2020-10-05 23:32:09,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:09,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:09,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730837768] [2020-10-05 23:32:09,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:32:09,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:32:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:09,642 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-05 23:32:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:09,723 INFO L93 Difference]: Finished difference Result 2338 states and 8870 transitions. [2020-10-05 23:32:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:09,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:32:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:09,735 INFO L225 Difference]: With dead ends: 2338 [2020-10-05 23:32:09,735 INFO L226 Difference]: Without dead ends: 2338 [2020-10-05 23:32:09,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2020-10-05 23:32:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2338. [2020-10-05 23:32:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-05 23:32:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-05 23:32:09,808 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-05 23:32:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:09,809 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-05 23:32:09,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:32:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-05 23:32:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:09,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:09,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:09,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:32:09,813 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times [2020-10-05 23:32:09,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:09,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097404932] [2020-10-05 23:32:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:09,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097404932] [2020-10-05 23:32:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:09,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:09,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275521408] [2020-10-05 23:32:09,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:32:09,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:32:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:09,898 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states. [2020-10-05 23:32:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:10,021 INFO L93 Difference]: Finished difference Result 2410 states and 9134 transitions. [2020-10-05 23:32:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:10,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:32:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:10,033 INFO L225 Difference]: With dead ends: 2410 [2020-10-05 23:32:10,033 INFO L226 Difference]: Without dead ends: 2410 [2020-10-05 23:32:10,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-05 23:32:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-05 23:32:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-05 23:32:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-05 23:32:10,114 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-05 23:32:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:10,115 INFO L479 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-05 23:32:10,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:32:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-05 23:32:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:32:10,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:10,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:10,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:32:10,120 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2046082702, now seen corresponding path program 1 times [2020-10-05 23:32:10,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:10,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947987985] [2020-10-05 23:32:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:10,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947987985] [2020-10-05 23:32:10,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:10,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:10,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262102034] [2020-10-05 23:32:10,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:10,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,293 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-05 23:32:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:10,411 INFO L93 Difference]: Finished difference Result 2898 states and 11072 transitions. [2020-10-05 23:32:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:10,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:32:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:10,426 INFO L225 Difference]: With dead ends: 2898 [2020-10-05 23:32:10,427 INFO L226 Difference]: Without dead ends: 2898 [2020-10-05 23:32:10,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-10-05 23:32:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2610. [2020-10-05 23:32:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-05 23:32:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-05 23:32:10,526 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-05 23:32:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:10,527 INFO L479 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-05 23:32:10,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-05 23:32:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:32:10,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:10,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:10,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:32:10,533 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1696833598, now seen corresponding path program 2 times [2020-10-05 23:32:10,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:10,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700455318] [2020-10-05 23:32:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:10,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700455318] [2020-10-05 23:32:10,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:10,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:10,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81452622] [2020-10-05 23:32:10,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:10,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,618 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-05 23:32:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:10,749 INFO L93 Difference]: Finished difference Result 3010 states and 11452 transitions. [2020-10-05 23:32:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:10,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:32:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:10,762 INFO L225 Difference]: With dead ends: 3010 [2020-10-05 23:32:10,762 INFO L226 Difference]: Without dead ends: 3010 [2020-10-05 23:32:10,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-10-05 23:32:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2890. [2020-10-05 23:32:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2020-10-05 23:32:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 10990 transitions. [2020-10-05 23:32:10,852 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 10990 transitions. Word has length 16 [2020-10-05 23:32:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:10,852 INFO L479 AbstractCegarLoop]: Abstraction has 2890 states and 10990 transitions. [2020-10-05 23:32:10,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 10990 transitions. [2020-10-05 23:32:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:32:10,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:10,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:10,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:32:10,858 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 549068308, now seen corresponding path program 3 times [2020-10-05 23:32:10,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:10,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761071960] [2020-10-05 23:32:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:10,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761071960] [2020-10-05 23:32:10,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:10,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:10,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090873913] [2020-10-05 23:32:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:10,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:10,944 INFO L87 Difference]: Start difference. First operand 2890 states and 10990 transitions. Second operand 6 states. [2020-10-05 23:32:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:11,088 INFO L93 Difference]: Finished difference Result 3202 states and 12124 transitions. [2020-10-05 23:32:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:32:11,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:32:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:11,102 INFO L225 Difference]: With dead ends: 3202 [2020-10-05 23:32:11,102 INFO L226 Difference]: Without dead ends: 3202 [2020-10-05 23:32:11,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-10-05 23:32:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2922. [2020-10-05 23:32:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2020-10-05 23:32:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11022 transitions. [2020-10-05 23:32:11,210 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 11022 transitions. Word has length 16 [2020-10-05 23:32:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:11,210 INFO L479 AbstractCegarLoop]: Abstraction has 2922 states and 11022 transitions. [2020-10-05 23:32:11,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 11022 transitions. [2020-10-05 23:32:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:32:11,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:11,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:11,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:32:11,219 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 1 times [2020-10-05 23:32:11,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:11,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161630004] [2020-10-05 23:32:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:11,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161630004] [2020-10-05 23:32:11,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:11,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:32:11,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867825020] [2020-10-05 23:32:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:32:11,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:32:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:11,405 INFO L87 Difference]: Start difference. First operand 2922 states and 11022 transitions. Second operand 7 states. [2020-10-05 23:32:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:11,544 INFO L93 Difference]: Finished difference Result 3442 states and 13032 transitions. [2020-10-05 23:32:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:11,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 23:32:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:11,556 INFO L225 Difference]: With dead ends: 3442 [2020-10-05 23:32:11,556 INFO L226 Difference]: Without dead ends: 3442 [2020-10-05 23:32:11,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2020-10-05 23:32:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3122. [2020-10-05 23:32:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-10-05 23:32:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 11848 transitions. [2020-10-05 23:32:11,738 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 11848 transitions. Word has length 17 [2020-10-05 23:32:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:11,738 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 11848 transitions. [2020-10-05 23:32:11,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:32:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 11848 transitions. [2020-10-05 23:32:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:32:11,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:11,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:11,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:32:11,745 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1063517833, now seen corresponding path program 2 times [2020-10-05 23:32:11,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:11,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094766609] [2020-10-05 23:32:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:11,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094766609] [2020-10-05 23:32:11,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:11,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:32:11,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112164113] [2020-10-05 23:32:11,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:32:11,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:32:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:11,881 INFO L87 Difference]: Start difference. First operand 3122 states and 11848 transitions. Second operand 7 states. [2020-10-05 23:32:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:11,999 INFO L93 Difference]: Finished difference Result 3362 states and 12692 transitions. [2020-10-05 23:32:12,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:12,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 23:32:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:12,009 INFO L225 Difference]: With dead ends: 3362 [2020-10-05 23:32:12,010 INFO L226 Difference]: Without dead ends: 3362 [2020-10-05 23:32:12,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2020-10-05 23:32:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3082. [2020-10-05 23:32:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2020-10-05 23:32:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 11694 transitions. [2020-10-05 23:32:12,110 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 11694 transitions. Word has length 17 [2020-10-05 23:32:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:12,110 INFO L479 AbstractCegarLoop]: Abstraction has 3082 states and 11694 transitions. [2020-10-05 23:32:12,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:32:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 11694 transitions. [2020-10-05 23:32:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:32:12,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:12,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:12,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:32:12,118 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 724387121, now seen corresponding path program 3 times [2020-10-05 23:32:12,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:12,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201749448] [2020-10-05 23:32:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:12,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201749448] [2020-10-05 23:32:12,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:12,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:32:12,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257420057] [2020-10-05 23:32:12,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:32:12,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:32:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:12,271 INFO L87 Difference]: Start difference. First operand 3082 states and 11694 transitions. Second operand 7 states. [2020-10-05 23:32:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:12,441 INFO L93 Difference]: Finished difference Result 3610 states and 13306 transitions. [2020-10-05 23:32:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:32:12,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 23:32:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:12,457 INFO L225 Difference]: With dead ends: 3610 [2020-10-05 23:32:12,457 INFO L226 Difference]: Without dead ends: 3466 [2020-10-05 23:32:12,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:32:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2020-10-05 23:32:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 2842. [2020-10-05 23:32:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2020-10-05 23:32:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 10562 transitions. [2020-10-05 23:32:12,542 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 10562 transitions. Word has length 17 [2020-10-05 23:32:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:12,542 INFO L479 AbstractCegarLoop]: Abstraction has 2842 states and 10562 transitions. [2020-10-05 23:32:12,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:32:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 10562 transitions. [2020-10-05 23:32:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:32:12,548 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:12,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:12,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:32:12,549 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times [2020-10-05 23:32:12,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:12,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27553707] [2020-10-05 23:32:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:12,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27553707] [2020-10-05 23:32:12,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:12,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:12,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151441019] [2020-10-05 23:32:12,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:12,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:12,613 INFO L87 Difference]: Start difference. First operand 2842 states and 10562 transitions. Second operand 4 states. [2020-10-05 23:32:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:12,663 INFO L93 Difference]: Finished difference Result 2992 states and 10144 transitions. [2020-10-05 23:32:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:12,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-05 23:32:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:12,671 INFO L225 Difference]: With dead ends: 2992 [2020-10-05 23:32:12,671 INFO L226 Difference]: Without dead ends: 2216 [2020-10-05 23:32:12,671 INFO L675 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 [2020-10-05 23:32:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2020-10-05 23:32:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2216. [2020-10-05 23:32:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:32:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 7438 transitions. [2020-10-05 23:32:12,726 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 7438 transitions. Word has length 17 [2020-10-05 23:32:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:12,727 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 7438 transitions. [2020-10-05 23:32:12,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 7438 transitions. [2020-10-05 23:32:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:32:12,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:12,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:12,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:32:12,732 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times [2020-10-05 23:32:12,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:12,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387953497] [2020-10-05 23:32:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:12,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387953497] [2020-10-05 23:32:12,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:12,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:12,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184213432] [2020-10-05 23:32:12,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:32:12,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:32:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:12,821 INFO L87 Difference]: Start difference. First operand 2216 states and 7438 transitions. Second operand 5 states. [2020-10-05 23:32:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:12,884 INFO L93 Difference]: Finished difference Result 1949 states and 6031 transitions. [2020-10-05 23:32:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:32:12,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 23:32:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:12,892 INFO L225 Difference]: With dead ends: 1949 [2020-10-05 23:32:12,892 INFO L226 Difference]: Without dead ends: 1461 [2020-10-05 23:32:12,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-10-05 23:32:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2020-10-05 23:32:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2020-10-05 23:32:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 4432 transitions. [2020-10-05 23:32:13,001 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 4432 transitions. Word has length 18 [2020-10-05 23:32:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:13,002 INFO L479 AbstractCegarLoop]: Abstraction has 1461 states and 4432 transitions. [2020-10-05 23:32:13,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:32:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 4432 transitions. [2020-10-05 23:32:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:32:13,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:13,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:13,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:32:13,008 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash 694225450, now seen corresponding path program 1 times [2020-10-05 23:32:13,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:13,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346062753] [2020-10-05 23:32:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:13,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346062753] [2020-10-05 23:32:13,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:13,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:32:13,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185994877] [2020-10-05 23:32:13,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:13,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:13,059 INFO L87 Difference]: Start difference. First operand 1461 states and 4432 transitions. Second operand 3 states. [2020-10-05 23:32:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:13,084 INFO L93 Difference]: Finished difference Result 2123 states and 6261 transitions. [2020-10-05 23:32:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:13,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-05 23:32:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:13,092 INFO L225 Difference]: With dead ends: 2123 [2020-10-05 23:32:13,093 INFO L226 Difference]: Without dead ends: 1473 [2020-10-05 23:32:13,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-10-05 23:32:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1445. [2020-10-05 23:32:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2020-10-05 23:32:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 4127 transitions. [2020-10-05 23:32:13,133 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 4127 transitions. Word has length 20 [2020-10-05 23:32:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:13,133 INFO L479 AbstractCegarLoop]: Abstraction has 1445 states and 4127 transitions. [2020-10-05 23:32:13,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 4127 transitions. [2020-10-05 23:32:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:32:13,138 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:13,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:13,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:32:13,139 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:13,139 INFO L82 PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times [2020-10-05 23:32:13,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:13,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756029964] [2020-10-05 23:32:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:13,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756029964] [2020-10-05 23:32:13,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:13,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:32:13,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878331488] [2020-10-05 23:32:13,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:13,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:13,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:13,249 INFO L87 Difference]: Start difference. First operand 1445 states and 4127 transitions. Second operand 6 states. [2020-10-05 23:32:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:13,338 INFO L93 Difference]: Finished difference Result 1283 states and 3615 transitions. [2020-10-05 23:32:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:32:13,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:32:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:13,342 INFO L225 Difference]: With dead ends: 1283 [2020-10-05 23:32:13,342 INFO L226 Difference]: Without dead ends: 1117 [2020-10-05 23:32:13,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2020-10-05 23:32:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 997. [2020-10-05 23:32:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-10-05 23:32:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2853 transitions. [2020-10-05 23:32:13,375 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2853 transitions. Word has length 21 [2020-10-05 23:32:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:13,376 INFO L479 AbstractCegarLoop]: Abstraction has 997 states and 2853 transitions. [2020-10-05 23:32:13,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2853 transitions. [2020-10-05 23:32:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:32:13,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:13,380 INFO L422 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] [2020-10-05 23:32:13,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:32:13,381 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:13,381 INFO L82 PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times [2020-10-05 23:32:13,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:13,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712176121] [2020-10-05 23:32:13,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:13,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712176121] [2020-10-05 23:32:13,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:13,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:32:13,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380597038] [2020-10-05 23:32:13,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:32:13,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:13,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:32:13,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:13,515 INFO L87 Difference]: Start difference. First operand 997 states and 2853 transitions. Second operand 7 states. [2020-10-05 23:32:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:13,607 INFO L93 Difference]: Finished difference Result 964 states and 2787 transitions. [2020-10-05 23:32:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:32:13,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:32:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:13,610 INFO L225 Difference]: With dead ends: 964 [2020-10-05 23:32:13,611 INFO L226 Difference]: Without dead ends: 589 [2020-10-05 23:32:13,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-10-05 23:32:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 493. [2020-10-05 23:32:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-05 23:32:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1397 transitions. [2020-10-05 23:32:13,624 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1397 transitions. Word has length 24 [2020-10-05 23:32:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:13,624 INFO L479 AbstractCegarLoop]: Abstraction has 493 states and 1397 transitions. [2020-10-05 23:32:13,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:32:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1397 transitions. [2020-10-05 23:32:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:32:13,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:13,626 INFO L422 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] [2020-10-05 23:32:13,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:32:13,626 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times [2020-10-05 23:32:13,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:13,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257095489] [2020-10-05 23:32:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:13,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257095489] [2020-10-05 23:32:13,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:13,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:13,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613936143] [2020-10-05 23:32:13,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:13,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:13,691 INFO L87 Difference]: Start difference. First operand 493 states and 1397 transitions. Second operand 4 states. [2020-10-05 23:32:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:13,708 INFO L93 Difference]: Finished difference Result 640 states and 1783 transitions. [2020-10-05 23:32:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:13,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-05 23:32:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:13,710 INFO L225 Difference]: With dead ends: 640 [2020-10-05 23:32:13,710 INFO L226 Difference]: Without dead ends: 190 [2020-10-05 23:32:13,711 INFO L675 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 [2020-10-05 23:32:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-05 23:32:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-10-05 23:32:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-05 23:32:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2020-10-05 23:32:13,714 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2020-10-05 23:32:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:13,715 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2020-10-05 23:32:13,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2020-10-05 23:32:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:32:13,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:13,716 INFO L422 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] [2020-10-05 23:32:13,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:32:13,716 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1827165113, now seen corresponding path program 2 times [2020-10-05 23:32:13,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:13,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675789451] [2020-10-05 23:32:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:13,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675789451] [2020-10-05 23:32:13,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:13,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:32:13,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55679843] [2020-10-05 23:32:13,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:32:13,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:32:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:13,907 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand 8 states. [2020-10-05 23:32:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:14,026 INFO L93 Difference]: Finished difference Result 228 states and 549 transitions. [2020-10-05 23:32:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:14,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-05 23:32:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:14,028 INFO L225 Difference]: With dead ends: 228 [2020-10-05 23:32:14,028 INFO L226 Difference]: Without dead ends: 168 [2020-10-05 23:32:14,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:32:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-10-05 23:32:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-10-05 23:32:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-05 23:32:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-05 23:32:14,032 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-05 23:32:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:14,033 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-05 23:32:14,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:32:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-05 23:32:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:32:14,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:14,034 INFO L422 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] [2020-10-05 23:32:14,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:32:14,034 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 3 times [2020-10-05 23:32:14,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:14,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808522463] [2020-10-05 23:32:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:32:14,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:32:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:32:14,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:32:14,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:32:14,151 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:32:14,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:32:14,152 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:32:14,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-1256240742 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-1256240742 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1256240742 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1256240742 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_Out-1256240742 ~y$r_buff0_thd0~0_In-1256240742) (or (and .cse0 .cse1 (= ~y~0_Out-1256240742 ~y$w_buff0~0_In-1256240742)) (and (or (and .cse2 (= ~y~0_Out-1256240742 ~y~0_In-1256240742)) (and (= ~y$w_buff1~0_In-1256240742 ~y~0_Out-1256240742) .cse3 .cse4)) .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1256240742| ULTIMATE.start_assume_abort_if_not_~cond_Out-1256240742) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1256240742 0)) (= ~y$r_buff1_thd0~0_In-1256240742 ~y$r_buff1_thd0~0_Out-1256240742) (or (and .cse2 (= ~y$w_buff1_used~0_Out-1256240742 ~y$w_buff1_used~0_In-1256240742)) (and (= ~y$w_buff1_used~0_Out-1256240742 0) .cse3 .cse4)) (or (and (= ~y$w_buff0_used~0_Out-1256240742 0) .cse0 .cse1) (and (= ~y$w_buff0_used~0_In-1256240742 ~y$w_buff0_used~0_Out-1256240742) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1256240742|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1256240742, ~y$w_buff1~0=~y$w_buff1~0_In-1256240742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1256240742, ~y$w_buff0~0=~y$w_buff0~0_In-1256240742, ~y~0=~y~0_In-1256240742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1256240742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1256240742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1256240742, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1256240742|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1256240742|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1256240742|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1256240742|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1256240742|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1256240742|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1256240742|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1256240742, ~y$w_buff1~0=~y$w_buff1~0_In-1256240742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1256240742, ~y$w_buff0~0=~y$w_buff0~0_In-1256240742, ~y~0=~y~0_Out-1256240742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1256240742, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1256240742} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:32:14,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,190 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,190 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,190 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,194 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:32:14,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:14,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:32:14 BasicIcfg [2020-10-05 23:32:14,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:32:14,276 INFO L168 Benchmark]: Toolchain (without parser) took 19102.40 ms. Allocated memory was 138.9 MB in the beginning and 530.1 MB in the end (delta: 391.1 MB). Free memory was 100.4 MB in the beginning and 204.0 MB in the end (delta: -103.6 MB). Peak memory consumption was 287.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,277 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.49 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.11 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 151.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,278 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,279 INFO L168 Benchmark]: RCFGBuilder took 2248.37 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 149.8 MB in the beginning and 167.3 MB in the end (delta: -17.5 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,282 INFO L168 Benchmark]: TraceAbstraction took 15930.16 ms. Allocated memory was 250.1 MB in the beginning and 530.1 MB in the end (delta: 280.0 MB). Free memory was 165.3 MB in the beginning and 204.0 MB in the end (delta: -38.7 MB). Peak memory consumption was 241.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:14,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.49 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.11 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 151.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.64 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2248.37 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 149.8 MB in the beginning and 167.3 MB in the end (delta: -17.5 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15930.16 ms. Allocated memory was 250.1 MB in the beginning and 530.1 MB in the end (delta: 280.0 MB). Free memory was 165.3 MB in the beginning and 204.0 MB in the end (delta: -38.7 MB). Peak memory consumption was 241.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.3s, 121 ProgramPointsBefore, 46 ProgramPointsAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 1335 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6712 CheckedPairsTotal, 87 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t821; [L834] FCALL, FORK 0 pthread_create(&t821, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t822; [L836] FCALL, FORK 0 pthread_create(&t822, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t823; [L838] FCALL, FORK 0 pthread_create(&t823, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 pthread_t t824; [L840] FCALL, FORK 0 pthread_create(&t824, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 734 SDtfs, 894 SDslu, 1169 SDs, 0 SdLazy, 548 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 2156 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 45751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...