/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:08:29,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:08:29,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:08:29,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:08:29,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:08:29,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:08:29,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:08:29,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:08:29,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:08:29,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:08:29,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:08:29,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:08:29,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:08:29,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:08:29,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:08:29,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:08:29,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:08:29,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:08:29,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:08:29,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:08:29,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:08:29,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:08:29,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:08:29,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:08:29,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:08:29,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:08:29,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:08:29,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:08:29,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:08:29,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:08:29,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:08:29,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:08:29,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:08:29,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:08:29,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:08:29,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:08:29,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:08:29,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:08:29,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:08:29,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:08:29,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:08:29,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2021-03-11 11:08:29,422 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:08:29,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:08:29,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:08:29,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:08:29,424 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:08:29,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:08:29,425 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:08:29,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:08:29,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:08:29,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:08:29,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:08:29,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:08:29,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:08:29,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 11:08:29,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:08:29,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:08:29,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:08:29,651 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:08:29,651 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:08:29,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2021-03-11 11:08:29,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a2ac90a/c5641a32f4464c949c695fbad0a1a01d/FLAGa6aa9d1cc [2021-03-11 11:08:30,131 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:08:30,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2021-03-11 11:08:30,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a2ac90a/c5641a32f4464c949c695fbad0a1a01d/FLAGa6aa9d1cc [2021-03-11 11:08:30,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a2ac90a/c5641a32f4464c949c695fbad0a1a01d [2021-03-11 11:08:30,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:08:30,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:08:30,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:08:30,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:08:30,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:08:30,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11085021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30, skipping insertion in model container [2021-03-11 11:08:30,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:08:30,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:08:30,602 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2021-03-11 11:08:30,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:08:30,745 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:08:30,752 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2021-03-11 11:08:30,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:08:30,824 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:08:30,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30 WrapperNode [2021-03-11 11:08:30,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:08:30,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:08:30,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:08:30,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:08:30,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:08:30,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:08:30,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:08:30,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:08:30,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (1/1) ... [2021-03-11 11:08:30,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:08:30,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:08:30,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:08:30,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:08:30,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (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 [2021-03-11 11:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:08:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:08:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:08:30,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:08:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:08:30,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:08:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:08:30,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:08:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 11:08:30,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 11:08:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:08:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:08:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:08:30,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:08:30,951 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:08:32,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:08:32,389 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:08:32,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:32 BoogieIcfgContainer [2021-03-11 11:08:32,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:08:32,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:08:32,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:08:32,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:08:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:08:30" (1/3) ... [2021-03-11 11:08:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:32, skipping insertion in model container [2021-03-11 11:08:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:08:30" (2/3) ... [2021-03-11 11:08:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d9028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:08:32, skipping insertion in model container [2021-03-11 11:08:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:08:32" (3/3) ... [2021-03-11 11:08:32,397 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2021-03-11 11:08:32,402 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:08:32,403 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:08:32,406 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:08:32,406 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:08:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,433 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,433 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,443 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,450 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,458 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,459 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:08:32,461 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:08:32,472 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 11:08:32,492 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:08:32,492 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:08:32,492 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:08:32,492 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:08:32,492 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:08:32,492 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:08:32,492 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:08:32,492 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:08:32,503 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:08:32,522 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 118 transitions, 256 flow [2021-03-11 11:08:32,524 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 118 transitions, 256 flow [2021-03-11 11:08:32,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-11 11:08:32,555 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-11 11:08:32,555 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:08:32,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-11 11:08:32,560 INFO L116 LiptonReduction]: Number of co-enabled transitions 2730 [2021-03-11 11:08:33,789 WARN L205 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-11 11:08:34,038 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-11 11:08:35,220 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-11 11:08:35,742 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 11:08:36,277 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:08:36,599 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 11:08:37,088 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 11:08:37,227 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 11:08:39,451 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 11:08:39,575 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 11:08:39,862 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 11:08:39,984 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 11:08:39,995 INFO L131 LiptonReduction]: Checked pairs total: 7483 [2021-03-11 11:08:39,995 INFO L133 LiptonReduction]: Total number of compositions: 95 [2021-03-11 11:08:40,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2021-03-11 11:08:40,164 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4610 states, 4606 states have (on average 4.156752062527138) internal successors, (19146), 4609 states have internal predecessors, (19146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 4610 states, 4606 states have (on average 4.156752062527138) internal successors, (19146), 4609 states have internal predecessors, (19146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 11:08:40,183 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:40,183 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:40,184 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2134558692, now seen corresponding path program 1 times [2021-03-11 11:08:40,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:40,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787388] [2021-03-11 11:08:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:40,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:40,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:40,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787388] [2021-03-11 11:08:40,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:40,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:08:40,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994778500] [2021-03-11 11:08:40,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:08:40,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:08:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:08:40,452 INFO L87 Difference]: Start difference. First operand has 4610 states, 4606 states have (on average 4.156752062527138) internal successors, (19146), 4609 states have internal predecessors, (19146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:40,539 INFO L93 Difference]: Finished difference Result 3850 states and 15248 transitions. [2021-03-11 11:08:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:08:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-03-11 11:08:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:40,569 INFO L225 Difference]: With dead ends: 3850 [2021-03-11 11:08:40,569 INFO L226 Difference]: Without dead ends: 3250 [2021-03-11 11:08:40,569 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:08:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-03-11 11:08:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2021-03-11 11:08:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2021-03-11 11:08:40,701 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2021-03-11 11:08:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:40,701 INFO L480 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2021-03-11 11:08:40,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2021-03-11 11:08:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:08:40,704 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:40,704 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:40,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:08:40,704 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2116230284, now seen corresponding path program 1 times [2021-03-11 11:08:40,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:40,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480566867] [2021-03-11 11:08:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:40,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:40,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:40,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:40,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:40,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480566867] [2021-03-11 11:08:40,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:40,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:08:40,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799413290] [2021-03-11 11:08:40,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:08:40,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:08:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:08:40,784 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:40,825 INFO L93 Difference]: Finished difference Result 3450 states and 13108 transitions. [2021-03-11 11:08:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:40,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-03-11 11:08:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:40,839 INFO L225 Difference]: With dead ends: 3450 [2021-03-11 11:08:40,840 INFO L226 Difference]: Without dead ends: 2850 [2021-03-11 11:08:40,840 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2021-03-11 11:08:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2850. [2021-03-11 11:08:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2849 states have (on average 3.86030186030186) internal successors, (10998), 2849 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10998 transitions. [2021-03-11 11:08:40,917 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10998 transitions. Word has length 12 [2021-03-11 11:08:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:40,917 INFO L480 AbstractCegarLoop]: Abstraction has 2850 states and 10998 transitions. [2021-03-11 11:08:40,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10998 transitions. [2021-03-11 11:08:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:08:40,922 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:40,922 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:40,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:08:40,922 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1599929671, now seen corresponding path program 1 times [2021-03-11 11:08:40,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:40,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587988078] [2021-03-11 11:08:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:41,127 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-03-11 11:08:41,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:08:41,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:08:41,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:41,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587988078] [2021-03-11 11:08:41,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:41,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:08:41,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605797841] [2021-03-11 11:08:41,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:08:41,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:08:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:41,148 INFO L87 Difference]: Start difference. First operand 2850 states and 10998 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:41,260 INFO L93 Difference]: Finished difference Result 3106 states and 11626 transitions. [2021-03-11 11:08:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:08:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-03-11 11:08:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:41,273 INFO L225 Difference]: With dead ends: 3106 [2021-03-11 11:08:41,273 INFO L226 Difference]: Without dead ends: 2706 [2021-03-11 11:08:41,273 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:08:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2021-03-11 11:08:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2021-03-11 11:08:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 3.812939001848429) internal successors, (10314), 2705 states have internal predecessors, (10314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 10314 transitions. [2021-03-11 11:08:41,339 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 10314 transitions. Word has length 14 [2021-03-11 11:08:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:41,340 INFO L480 AbstractCegarLoop]: Abstraction has 2706 states and 10314 transitions. [2021-03-11 11:08:41,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 10314 transitions. [2021-03-11 11:08:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:08:41,343 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:41,343 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:41,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:08:41,343 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1752321432, now seen corresponding path program 1 times [2021-03-11 11:08:41,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:41,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614428949] [2021-03-11 11:08:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:41,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:41,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:41,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614428949] [2021-03-11 11:08:41,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:41,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:08:41,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398745659] [2021-03-11 11:08:41,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:08:41,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:08:41,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:08:41,443 INFO L87 Difference]: Start difference. First operand 2706 states and 10314 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:41,474 INFO L93 Difference]: Finished difference Result 2930 states and 10912 transitions. [2021-03-11 11:08:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-03-11 11:08:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:41,486 INFO L225 Difference]: With dead ends: 2930 [2021-03-11 11:08:41,486 INFO L226 Difference]: Without dead ends: 2650 [2021-03-11 11:08:41,486 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2021-03-11 11:08:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2021-03-11 11:08:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2649 states have (on average 3.801434503586259) internal successors, (10070), 2649 states have internal predecessors, (10070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10070 transitions. [2021-03-11 11:08:41,546 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10070 transitions. Word has length 16 [2021-03-11 11:08:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:41,546 INFO L480 AbstractCegarLoop]: Abstraction has 2650 states and 10070 transitions. [2021-03-11 11:08:41,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10070 transitions. [2021-03-11 11:08:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:08:41,549 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:41,549 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:41,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:08:41,549 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1792981028, now seen corresponding path program 1 times [2021-03-11 11:08:41,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:41,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408026560] [2021-03-11 11:08:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:41,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:41,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:08:41,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:41,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:08:41,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:41,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408026560] [2021-03-11 11:08:41,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:41,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:08:41,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34872116] [2021-03-11 11:08:41,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:08:41,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:08:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:08:41,650 INFO L87 Difference]: Start difference. First operand 2650 states and 10070 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:41,795 INFO L93 Difference]: Finished difference Result 2954 states and 11010 transitions. [2021-03-11 11:08:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:08:41,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-11 11:08:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:41,808 INFO L225 Difference]: With dead ends: 2954 [2021-03-11 11:08:41,808 INFO L226 Difference]: Without dead ends: 2738 [2021-03-11 11:08:41,808 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:08:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2021-03-11 11:08:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2690. [2021-03-11 11:08:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2689 states have (on average 3.7902566009669023) internal successors, (10192), 2689 states have internal predecessors, (10192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 10192 transitions. [2021-03-11 11:08:41,875 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 10192 transitions. Word has length 17 [2021-03-11 11:08:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:41,876 INFO L480 AbstractCegarLoop]: Abstraction has 2690 states and 10192 transitions. [2021-03-11 11:08:41,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 10192 transitions. [2021-03-11 11:08:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:08:41,879 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:41,879 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:41,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:08:41,879 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1372262396, now seen corresponding path program 1 times [2021-03-11 11:08:41,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:41,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598840250] [2021-03-11 11:08:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:41,951 INFO L142 QuantifierPusher]: treesize reduction 27, result has 43.8 percent of original size [2021-03-11 11:08:41,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:08:41,965 INFO L142 QuantifierPusher]: treesize reduction 17, result has 46.9 percent of original size [2021-03-11 11:08:41,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:08:41,975 INFO L142 QuantifierPusher]: treesize reduction 17, result has 52.8 percent of original size [2021-03-11 11:08:41,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:08:41,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:41,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:41,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598840250] [2021-03-11 11:08:41,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:41,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:08:41,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544673479] [2021-03-11 11:08:41,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:08:41,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:08:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:41,988 INFO L87 Difference]: Start difference. First operand 2690 states and 10192 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:42,069 INFO L93 Difference]: Finished difference Result 2798 states and 10444 transitions. [2021-03-11 11:08:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-11 11:08:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:42,089 INFO L225 Difference]: With dead ends: 2798 [2021-03-11 11:08:42,089 INFO L226 Difference]: Without dead ends: 2618 [2021-03-11 11:08:42,089 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:08:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-03-11 11:08:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2546. [2021-03-11 11:08:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 3.7901768172888017) internal successors, (9646), 2545 states have internal predecessors, (9646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9646 transitions. [2021-03-11 11:08:42,154 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9646 transitions. Word has length 17 [2021-03-11 11:08:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:42,154 INFO L480 AbstractCegarLoop]: Abstraction has 2546 states and 9646 transitions. [2021-03-11 11:08:42,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9646 transitions. [2021-03-11 11:08:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:08:42,158 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:42,158 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:42,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:08:42,159 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 247945487, now seen corresponding path program 1 times [2021-03-11 11:08:42,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:42,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116917983] [2021-03-11 11:08:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:42,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:42,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:08:42,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:42,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:08:42,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:08:42,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:42,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116917983] [2021-03-11 11:08:42,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:42,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:08:42,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810627587] [2021-03-11 11:08:42,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:08:42,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:08:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:08:42,301 INFO L87 Difference]: Start difference. First operand 2546 states and 9646 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:42,422 INFO L93 Difference]: Finished difference Result 3338 states and 12540 transitions. [2021-03-11 11:08:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:08:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-03-11 11:08:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:42,432 INFO L225 Difference]: With dead ends: 3338 [2021-03-11 11:08:42,432 INFO L226 Difference]: Without dead ends: 3146 [2021-03-11 11:08:42,433 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:08:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2021-03-11 11:08:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3034. [2021-03-11 11:08:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 3.7718430596768875) internal successors, (11440), 3033 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 11440 transitions. [2021-03-11 11:08:42,496 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 11440 transitions. Word has length 18 [2021-03-11 11:08:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 3034 states and 11440 transitions. [2021-03-11 11:08:42,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 11440 transitions. [2021-03-11 11:08:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:08:42,501 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:42,501 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:42,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:08:42,502 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash -252165045, now seen corresponding path program 2 times [2021-03-11 11:08:42,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:42,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221346211] [2021-03-11 11:08:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:42,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:42,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:08:42,598 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 11:08:42,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 11:08:42,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:08:42,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:42,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:42,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221346211] [2021-03-11 11:08:42,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:42,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:08:42,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979895842] [2021-03-11 11:08:42,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:08:42,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:08:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:08:42,636 INFO L87 Difference]: Start difference. First operand 3034 states and 11440 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:42,759 INFO L93 Difference]: Finished difference Result 3474 states and 12958 transitions. [2021-03-11 11:08:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:08:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-03-11 11:08:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:42,770 INFO L225 Difference]: With dead ends: 3474 [2021-03-11 11:08:42,770 INFO L226 Difference]: Without dead ends: 3282 [2021-03-11 11:08:42,770 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:08:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2021-03-11 11:08:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2986. [2021-03-11 11:08:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2985 states have (on average 3.7775544388609714) internal successors, (11276), 2985 states have internal predecessors, (11276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 11276 transitions. [2021-03-11 11:08:42,831 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 11276 transitions. Word has length 18 [2021-03-11 11:08:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:42,832 INFO L480 AbstractCegarLoop]: Abstraction has 2986 states and 11276 transitions. [2021-03-11 11:08:42,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 11276 transitions. [2021-03-11 11:08:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:08:42,836 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:42,836 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:42,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:08:42,836 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1394568847, now seen corresponding path program 3 times [2021-03-11 11:08:42,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:42,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756626862] [2021-03-11 11:08:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:42,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:42,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:42,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:08:42,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:08:42,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:08:42,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:42,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:42,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756626862] [2021-03-11 11:08:42,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:42,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:08:42,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64507305] [2021-03-11 11:08:42,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:08:42,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:08:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:08:42,961 INFO L87 Difference]: Start difference. First operand 2986 states and 11276 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:43,106 INFO L93 Difference]: Finished difference Result 3602 states and 13526 transitions. [2021-03-11 11:08:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:08:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-03-11 11:08:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:43,118 INFO L225 Difference]: With dead ends: 3602 [2021-03-11 11:08:43,118 INFO L226 Difference]: Without dead ends: 3442 [2021-03-11 11:08:43,118 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:08:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2021-03-11 11:08:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3122. [2021-03-11 11:08:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 3.793015059275873) internal successors, (11838), 3121 states have internal predecessors, (11838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 11838 transitions. [2021-03-11 11:08:43,183 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 11838 transitions. Word has length 18 [2021-03-11 11:08:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:43,184 INFO L480 AbstractCegarLoop]: Abstraction has 3122 states and 11838 transitions. [2021-03-11 11:08:43,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 11838 transitions. [2021-03-11 11:08:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:08:43,188 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:43,188 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:43,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:08:43,189 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 714888047, now seen corresponding path program 4 times [2021-03-11 11:08:43,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:43,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94561993] [2021-03-11 11:08:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:43,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:43,237 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 11:08:43,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 11:08:43,250 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-11 11:08:43,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 11:08:43,268 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 11:08:43,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 11:08:43,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:08:43,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:43,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94561993] [2021-03-11 11:08:43,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:43,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:08:43,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855392883] [2021-03-11 11:08:43,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:08:43,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:08:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:08:43,311 INFO L87 Difference]: Start difference. First operand 3122 states and 11838 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:43,463 INFO L93 Difference]: Finished difference Result 4258 states and 15602 transitions. [2021-03-11 11:08:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:08:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-03-11 11:08:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:43,483 INFO L225 Difference]: With dead ends: 4258 [2021-03-11 11:08:43,483 INFO L226 Difference]: Without dead ends: 3826 [2021-03-11 11:08:43,483 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 104.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-03-11 11:08:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2021-03-11 11:08:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 2962. [2021-03-11 11:08:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2961 states have (on average 3.719689294157379) internal successors, (11014), 2961 states have internal predecessors, (11014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11014 transitions. [2021-03-11 11:08:43,573 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 11014 transitions. Word has length 18 [2021-03-11 11:08:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:43,573 INFO L480 AbstractCegarLoop]: Abstraction has 2962 states and 11014 transitions. [2021-03-11 11:08:43,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 11014 transitions. [2021-03-11 11:08:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:08:43,577 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:43,577 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:43,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:08:43,577 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash 223992783, now seen corresponding path program 1 times [2021-03-11 11:08:43,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:43,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248135653] [2021-03-11 11:08:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:43,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,629 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:08:43,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:43,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:08:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:43,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248135653] [2021-03-11 11:08:43,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:43,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:08:43,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168699278] [2021-03-11 11:08:43,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:08:43,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:08:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:08:43,636 INFO L87 Difference]: Start difference. First operand 2962 states and 11014 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:43,663 INFO L93 Difference]: Finished difference Result 3054 states and 10350 transitions. [2021-03-11 11:08:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-03-11 11:08:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:43,669 INFO L225 Difference]: With dead ends: 3054 [2021-03-11 11:08:43,669 INFO L226 Difference]: Without dead ends: 2310 [2021-03-11 11:08:43,669 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2021-03-11 11:08:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2310. [2021-03-11 11:08:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2309 states have (on average 3.360762234733651) internal successors, (7760), 2309 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 7760 transitions. [2021-03-11 11:08:43,714 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 7760 transitions. Word has length 18 [2021-03-11 11:08:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:43,714 INFO L480 AbstractCegarLoop]: Abstraction has 2310 states and 7760 transitions. [2021-03-11 11:08:43,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 7760 transitions. [2021-03-11 11:08:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:08:43,717 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:43,717 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:43,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:08:43,717 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1352905703, now seen corresponding path program 1 times [2021-03-11 11:08:43,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:43,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593165453] [2021-03-11 11:08:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:43,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,776 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-11 11:08:43,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:08:43,784 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:08:43,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:43,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:08:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:43,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593165453] [2021-03-11 11:08:43,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:43,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:08:43,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013339630] [2021-03-11 11:08:43,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:08:43,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:08:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:43,792 INFO L87 Difference]: Start difference. First operand 2310 states and 7760 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:43,824 INFO L93 Difference]: Finished difference Result 1960 states and 6029 transitions. [2021-03-11 11:08:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:08:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-03-11 11:08:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:43,828 INFO L225 Difference]: With dead ends: 1960 [2021-03-11 11:08:43,828 INFO L226 Difference]: Without dead ends: 1492 [2021-03-11 11:08:43,828 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:08:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2021-03-11 11:08:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2021-03-11 11:08:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1491 states have (on average 3.0194500335345404) internal successors, (4502), 1491 states have internal predecessors, (4502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 4502 transitions. [2021-03-11 11:08:43,848 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 4502 transitions. Word has length 19 [2021-03-11 11:08:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:43,849 INFO L480 AbstractCegarLoop]: Abstraction has 1492 states and 4502 transitions. [2021-03-11 11:08:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 4502 transitions. [2021-03-11 11:08:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-03-11 11:08:43,851 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:43,851 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:43,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:08:43,851 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash 451967147, now seen corresponding path program 1 times [2021-03-11 11:08:43,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:43,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930247879] [2021-03-11 11:08:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:43,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:08:43,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:43,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930247879] [2021-03-11 11:08:43,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:43,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:08:43,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249450613] [2021-03-11 11:08:43,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:08:43,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:08:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:08:43,893 INFO L87 Difference]: Start difference. First operand 1492 states and 4502 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:43,915 INFO L93 Difference]: Finished difference Result 2237 states and 6512 transitions. [2021-03-11 11:08:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:43,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-03-11 11:08:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:43,920 INFO L225 Difference]: With dead ends: 2237 [2021-03-11 11:08:43,920 INFO L226 Difference]: Without dead ends: 1516 [2021-03-11 11:08:43,920 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:08:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-03-11 11:08:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1476. [2021-03-11 11:08:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 2.848813559322034) internal successors, (4202), 1475 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4202 transitions. [2021-03-11 11:08:43,939 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4202 transitions. Word has length 21 [2021-03-11 11:08:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:43,939 INFO L480 AbstractCegarLoop]: Abstraction has 1476 states and 4202 transitions. [2021-03-11 11:08:43,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4202 transitions. [2021-03-11 11:08:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:08:43,942 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:43,942 INFO L519 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] [2021-03-11 11:08:43,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:08:43,943 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -431472981, now seen corresponding path program 1 times [2021-03-11 11:08:43,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:43,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967659859] [2021-03-11 11:08:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:43,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:43,991 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:08:43,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:43,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:43,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:08:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:43,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967659859] [2021-03-11 11:08:43,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:43,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:08:43,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184973762] [2021-03-11 11:08:43,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:08:43,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:08:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:08:43,999 INFO L87 Difference]: Start difference. First operand 1476 states and 4202 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:44,039 INFO L93 Difference]: Finished difference Result 1268 states and 3552 transitions. [2021-03-11 11:08:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:08:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-03-11 11:08:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:44,041 INFO L225 Difference]: With dead ends: 1268 [2021-03-11 11:08:44,042 INFO L226 Difference]: Without dead ends: 1106 [2021-03-11 11:08:44,042 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:08:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-03-11 11:08:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1010. [2021-03-11 11:08:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 2.852329038652131) internal successors, (2878), 1009 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2878 transitions. [2021-03-11 11:08:44,056 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2878 transitions. Word has length 22 [2021-03-11 11:08:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:44,056 INFO L480 AbstractCegarLoop]: Abstraction has 1010 states and 2878 transitions. [2021-03-11 11:08:44,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2878 transitions. [2021-03-11 11:08:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-03-11 11:08:44,059 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:44,059 INFO L519 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] [2021-03-11 11:08:44,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:08:44,059 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -610579298, now seen corresponding path program 1 times [2021-03-11 11:08:44,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:44,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378301050] [2021-03-11 11:08:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:44,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:44,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:44,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:44,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:08:44,124 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:08:44,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:44,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:08:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:44,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378301050] [2021-03-11 11:08:44,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:44,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:08:44,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850583377] [2021-03-11 11:08:44,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:08:44,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:08:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:08:44,135 INFO L87 Difference]: Start difference. First operand 1010 states and 2878 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:44,182 INFO L93 Difference]: Finished difference Result 965 states and 2788 transitions. [2021-03-11 11:08:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:08:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-03-11 11:08:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:44,184 INFO L225 Difference]: With dead ends: 965 [2021-03-11 11:08:44,184 INFO L226 Difference]: Without dead ends: 590 [2021-03-11 11:08:44,185 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:08:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2021-03-11 11:08:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 494. [2021-03-11 11:08:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.8356997971602436) internal successors, (1398), 493 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1398 transitions. [2021-03-11 11:08:44,192 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1398 transitions. Word has length 25 [2021-03-11 11:08:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:44,192 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 1398 transitions. [2021-03-11 11:08:44,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1398 transitions. [2021-03-11 11:08:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-03-11 11:08:44,193 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:44,193 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:44,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 11:08:44,193 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1320668746, now seen corresponding path program 1 times [2021-03-11 11:08:44,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:44,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423234393] [2021-03-11 11:08:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:44,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:44,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:44,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:08:44,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:44,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:08:44,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:08:44,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:44,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423234393] [2021-03-11 11:08:44,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:44,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:08:44,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087605775] [2021-03-11 11:08:44,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:08:44,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:08:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:08:44,302 INFO L87 Difference]: Start difference. First operand 494 states and 1398 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:44,459 INFO L93 Difference]: Finished difference Result 798 states and 2243 transitions. [2021-03-11 11:08:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 11:08:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-03-11 11:08:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:44,460 INFO L225 Difference]: With dead ends: 798 [2021-03-11 11:08:44,460 INFO L226 Difference]: Without dead ends: 239 [2021-03-11 11:08:44,460 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-03-11 11:08:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-03-11 11:08:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 191. [2021-03-11 11:08:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.442105263157895) internal successors, (464), 190 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 464 transitions. [2021-03-11 11:08:44,463 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 464 transitions. Word has length 28 [2021-03-11 11:08:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:44,463 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 464 transitions. [2021-03-11 11:08:44,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 464 transitions. [2021-03-11 11:08:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-03-11 11:08:44,463 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:44,463 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:44,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 11:08:44,463 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash 327135830, now seen corresponding path program 2 times [2021-03-11 11:08:44,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:44,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098369572] [2021-03-11 11:08:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:08:44,549 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 11:08:44,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:08:44,555 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-11 11:08:44,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-11 11:08:44,588 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.4 percent of original size [2021-03-11 11:08:44,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-03-11 11:08:44,628 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-11 11:08:44,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-11 11:08:44,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:44,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:08:44,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:08:44,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:08:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:08:44,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098369572] [2021-03-11 11:08:44,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:08:44,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:08:44,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541420444] [2021-03-11 11:08:44,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:08:44,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:08:44,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:08:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:08:44,680 INFO L87 Difference]: Start difference. First operand 191 states and 464 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:08:44,827 INFO L93 Difference]: Finished difference Result 230 states and 551 transitions. [2021-03-11 11:08:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:08:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-03-11 11:08:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:08:44,828 INFO L225 Difference]: With dead ends: 230 [2021-03-11 11:08:44,828 INFO L226 Difference]: Without dead ends: 169 [2021-03-11 11:08:44,828 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 191.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:08:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-03-11 11:08:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-03-11 11:08:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4761904761904763) internal successors, (416), 168 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 416 transitions. [2021-03-11 11:08:44,830 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 416 transitions. Word has length 28 [2021-03-11 11:08:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:08:44,831 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 416 transitions. [2021-03-11 11:08:44,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:08:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 416 transitions. [2021-03-11 11:08:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-03-11 11:08:44,831 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:08:44,831 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:08:44,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 11:08:44,831 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:08:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:08:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 78716024, now seen corresponding path program 3 times [2021-03-11 11:08:44,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:08:44,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323982807] [2021-03-11 11:08:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:08:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:08:44,860 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:08:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:08:44,884 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:08:44,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:08:44,905 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:08:44,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 11:08:44,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:08:44 BasicIcfg [2021-03-11 11:08:44,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:08:44,992 INFO L168 Benchmark]: Toolchain (without parser) took 14532.64 ms. Allocated memory was 377.5 MB in the beginning and 706.7 MB in the end (delta: 329.3 MB). Free memory was 340.9 MB in the beginning and 502.3 MB in the end (delta: -161.3 MB). Peak memory consumption was 170.7 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:44,995 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 377.5 MB. Free memory was 359.1 MB in the beginning and 359.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:08:44,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.30 ms. Allocated memory is still 377.5 MB. Free memory was 340.3 MB in the beginning and 335.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:44,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.47 ms. Allocated memory is still 377.5 MB. Free memory was 335.9 MB in the beginning and 332.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:44,995 INFO L168 Benchmark]: Boogie Preprocessor took 21.06 ms. Allocated memory is still 377.5 MB. Free memory was 332.8 MB in the beginning and 330.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:44,996 INFO L168 Benchmark]: RCFGBuilder took 1511.16 ms. Allocated memory is still 377.5 MB. Free memory was 330.7 MB in the beginning and 315.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 202.0 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:44,996 INFO L168 Benchmark]: TraceAbstraction took 12598.49 ms. Allocated memory was 377.5 MB in the beginning and 706.7 MB in the end (delta: 329.3 MB). Free memory was 314.3 MB in the beginning and 502.3 MB in the end (delta: -188.0 MB). Peak memory consumption was 141.3 MB. Max. memory is 16.0 GB. [2021-03-11 11:08:45,000 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 377.5 MB. Free memory was 359.1 MB in the beginning and 359.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 359.30 ms. Allocated memory is still 377.5 MB. Free memory was 340.3 MB in the beginning and 335.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.47 ms. Allocated memory is still 377.5 MB. Free memory was 335.9 MB in the beginning and 332.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.06 ms. Allocated memory is still 377.5 MB. Free memory was 332.8 MB in the beginning and 330.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1511.16 ms. Allocated memory is still 377.5 MB. Free memory was 330.7 MB in the beginning and 315.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 202.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12598.49 ms. Allocated memory was 377.5 MB in the beginning and 706.7 MB in the end (delta: 329.3 MB). Free memory was 314.3 MB in the beginning and 502.3 MB in the end (delta: -188.0 MB). Peak memory consumption was 141.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7471.6ms, 129 PlacesBefore, 47 PlacesAfterwards, 118 TransitionsBefore, 35 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 7483 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3362, positive: 3168, positive conditional: 0, positive unconditional: 3168, negative: 194, negative conditional: 0, negative unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1911, positive: 1856, positive conditional: 0, positive unconditional: 1856, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1911, positive: 1838, positive conditional: 0, positive unconditional: 1838, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 787, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 759, negative conditional: 0, negative unconditional: 759, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3362, positive: 1312, positive conditional: 0, positive unconditional: 1312, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 1911, unknown conditional: 0, unknown unconditional: 1911] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L857] 0 pthread_t t1084; [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L829] 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) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] 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) [L829] 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) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 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 [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 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 [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L773] 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) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] 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) [L773] 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) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 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 [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 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 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 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) [L875] 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) [L876] 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)) [L876] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] EXPR 0 !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) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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) [L878] 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)) [L878] 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)) [L879] 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)) [L879] EXPR 0 !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) [L879] 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)) [L879] 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)) [L880] 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)) [L880] EXPR 0 !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) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12415.7ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 66.8ms, AutomataDifference: 1733.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7672.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 695 SDtfs, 982 SDslu, 1814 SDs, 0 SdLazy, 767 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 721.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 763.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4610occurred in iteration=0, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 841.1ms AutomataMinimizationTime, 17 MinimizatonAttempts, 1992 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.1ms SsaConstructionTime, 610.8ms SatisfiabilityAnalysisTime, 1184.8ms InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 2797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...