./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-96f1638 [2020-12-02 12:07:29,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:07:29,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:07:29,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:07:29,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:07:29,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:07:29,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:07:29,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:07:29,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:07:29,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:07:29,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:07:29,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:07:29,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:07:29,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:07:29,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:07:29,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:07:29,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:07:29,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:07:29,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:07:29,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:07:29,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:07:29,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:07:29,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:07:29,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:07:29,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:07:29,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:07:29,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:07:29,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:07:29,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:07:29,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:07:29,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:07:29,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:07:29,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:07:29,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:07:29,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:07:29,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:07:29,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:07:29,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:07:29,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:07:29,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:07:29,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:07:29,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 12:07:29,975 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:07:29,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:07:29,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:07:29,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:07:29,980 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:07:29,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:07:29,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:07:29,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:07:29,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:07:29,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:07:29,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:07:29,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:07:29,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:07:29,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:07:29,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:07:29,984 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:07:29,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:07:29,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:07:29,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:07:29,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:07:29,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:07:29,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:07:29,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:07:29,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:07:29,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:07:29,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:07:29,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:07:29,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:07:29,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:07:29,988 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 [2020-12-02 12:07:30,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:07:30,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:07:30,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:07:30,417 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:07:30,418 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:07:30,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2020-12-02 12:07:30,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa158c34d/342e22bace1740678c5cbc58774b4d12/FLAG73813fd0b [2020-12-02 12:07:31,214 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:07:31,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2020-12-02 12:07:31,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa158c34d/342e22bace1740678c5cbc58774b4d12/FLAG73813fd0b [2020-12-02 12:07:31,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa158c34d/342e22bace1740678c5cbc58774b4d12 [2020-12-02 12:07:31,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:07:31,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:07:31,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:07:31,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:07:31,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:07:31,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:07:31" (1/1) ... [2020-12-02 12:07:31,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231e60c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:31, skipping insertion in model container [2020-12-02 12:07:31,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:07:31" (1/1) ... [2020-12-02 12:07:31,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:07:31,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:07:31,782 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i[950,963] [2020-12-02 12:07:32,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:07:32,148 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:07:32,172 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i[950,963] [2020-12-02 12:07:32,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:07:32,360 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:07:32,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32 WrapperNode [2020-12-02 12:07:32,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:07:32,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:07:32,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:07:32,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:07:32,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:07:32,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:07:32,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:07:32,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:07:32,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... [2020-12-02 12:07:32,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:07:32,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:07:32,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:07:32,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:07:32,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:07:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:07:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:07:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:07:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:07:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:07:32,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:07:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:07:32,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:07:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:07:32,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:07:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:07:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:07:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:07:32,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:07:32,631 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 12:07:34,927 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:07:34,927 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:07:34,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:07:34 BoogieIcfgContainer [2020-12-02 12:07:34,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:07:34,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:07:34,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:07:34,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:07:34,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:07:31" (1/3) ... [2020-12-02 12:07:34,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b083acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:07:34, skipping insertion in model container [2020-12-02 12:07:34,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:07:32" (2/3) ... [2020-12-02 12:07:34,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b083acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:07:34, skipping insertion in model container [2020-12-02 12:07:34,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:07:34" (3/3) ... [2020-12-02 12:07:34,938 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-12-02 12:07:34,953 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:07:34,954 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:07:34,958 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:07:34,959 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:07:34,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:34,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,007 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,008 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,008 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,008 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,010 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,011 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,014 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,014 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,015 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,015 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,015 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,019 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,020 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,020 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,021 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,028 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,028 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,032 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,033 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,038 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:07:35,040 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:07:35,053 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 12:07:35,077 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:07:35,077 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:07:35,077 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:07:35,077 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:07:35,077 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:07:35,078 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:07:35,078 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:07:35,078 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:07:35,092 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:07:35,094 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-02 12:07:35,098 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-02 12:07:35,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-12-02 12:07:35,152 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-12-02 12:07:35,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:07:35,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-12-02 12:07:35,168 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2020-12-02 12:07:36,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:36,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:36,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:36,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:36,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:36,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:36,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:36,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:36,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:36,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:36,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:36,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-02 12:07:36,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:36,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:36,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:36,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:36,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:36,530 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:07:36,647 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 12:07:37,193 WARN L197 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-12-02 12:07:37,405 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:07:37,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:37,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:37,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:37,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:37,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:37,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 12:07:37,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 12:07:37,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,853 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-02 12:07:37,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:37,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:37,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:37,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:39,030 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-12-02 12:07:39,531 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2020-12-02 12:07:41,700 WARN L197 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-12-02 12:07:42,729 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 263 [2020-12-02 12:07:42,848 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:42,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:42,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:42,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:42,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:42,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:42,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:42,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:42,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:43,348 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:07:43,464 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:07:43,690 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-02 12:07:43,911 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-02 12:07:43,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:43,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:43,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:43,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:43,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:43,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:43,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:43,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:43,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:07:44,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:07:44,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:44,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:44,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:44,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:44,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 12:07:44,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:44,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:44,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:44,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:44,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:07:44,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:07:44,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:44,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:44,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:44,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,176 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:45,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:45,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:07:45,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:07:45,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:07:45,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:07:45,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:45,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:07:45,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:07:46,224 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-02 12:07:46,331 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-02 12:07:46,442 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-02 12:07:46,679 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-02 12:07:46,846 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-02 12:07:47,024 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-02 12:07:47,190 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-12-02 12:07:47,644 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2020-12-02 12:07:47,851 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:07:48,311 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2020-12-02 12:07:48,524 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 12:07:48,530 INFO L131 LiptonReduction]: Checked pairs total: 4814 [2020-12-02 12:07:48,530 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-02 12:07:48,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-12-02 12:07:48,599 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-12-02 12:07:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-12-02 12:07:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-02 12:07:48,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:48,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-02 12:07:48,608 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1057934, now seen corresponding path program 1 times [2020-12-02 12:07:48,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:48,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616667661] [2020-12-02 12:07:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:48,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616667661] [2020-12-02 12:07:48,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:48,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:07:48,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092354395] [2020-12-02 12:07:48,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:07:48,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:07:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:07:48,879 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-12-02 12:07:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:49,003 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-12-02 12:07:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:07:49,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-02 12:07:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:49,042 INFO L225 Difference]: With dead ends: 812 [2020-12-02 12:07:49,042 INFO L226 Difference]: Without dead ends: 687 [2020-12-02 12:07:49,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:07:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-12-02 12:07:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-12-02 12:07:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-12-02 12:07:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-12-02 12:07:49,164 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-12-02 12:07:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:49,164 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-12-02 12:07:49,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:07:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-12-02 12:07:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 12:07:49,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:49,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:49,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:07:49,167 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash -332907457, now seen corresponding path program 1 times [2020-12-02 12:07:49,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:49,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312087648] [2020-12-02 12:07:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:49,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312087648] [2020-12-02 12:07:49,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:49,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:07:49,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103409085] [2020-12-02 12:07:49,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:07:49,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:07:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:07:49,376 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-12-02 12:07:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:49,413 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2020-12-02 12:07:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:07:49,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 12:07:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:49,419 INFO L225 Difference]: With dead ends: 792 [2020-12-02 12:07:49,420 INFO L226 Difference]: Without dead ends: 667 [2020-12-02 12:07:49,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-12-02 12:07:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-12-02 12:07:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-12-02 12:07:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-12-02 12:07:49,450 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2020-12-02 12:07:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:49,451 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-12-02 12:07:49,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:07:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-12-02 12:07:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 12:07:49,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:49,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:49,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:07:49,454 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1082766274, now seen corresponding path program 1 times [2020-12-02 12:07:49,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:49,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286381713] [2020-12-02 12:07:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:49,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286381713] [2020-12-02 12:07:49,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:49,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:07:49,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822672546] [2020-12-02 12:07:49,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:07:49,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:07:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:07:49,587 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-12-02 12:07:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:49,620 INFO L93 Difference]: Finished difference Result 736 states and 2205 transitions. [2020-12-02 12:07:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:07:49,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 12:07:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:49,626 INFO L225 Difference]: With dead ends: 736 [2020-12-02 12:07:49,627 INFO L226 Difference]: Without dead ends: 621 [2020-12-02 12:07:49,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-12-02 12:07:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2020-12-02 12:07:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2020-12-02 12:07:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions. [2020-12-02 12:07:49,651 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11 [2020-12-02 12:07:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:49,652 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions. [2020-12-02 12:07:49,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:07:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions. [2020-12-02 12:07:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:07:49,654 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:49,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:49,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:07:49,655 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -794597533, now seen corresponding path program 1 times [2020-12-02 12:07:49,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:49,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201115822] [2020-12-02 12:07:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:49,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201115822] [2020-12-02 12:07:49,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:49,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:07:49,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014895781] [2020-12-02 12:07:49,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:07:49,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:07:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:49,777 INFO L87 Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 5 states. [2020-12-02 12:07:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:49,837 INFO L93 Difference]: Finished difference Result 829 states and 2510 transitions. [2020-12-02 12:07:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:49,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-02 12:07:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:49,842 INFO L225 Difference]: With dead ends: 829 [2020-12-02 12:07:49,842 INFO L226 Difference]: Without dead ends: 437 [2020-12-02 12:07:49,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-02 12:07:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-12-02 12:07:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-02 12:07:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2020-12-02 12:07:49,889 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12 [2020-12-02 12:07:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:49,889 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2020-12-02 12:07:49,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:07:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2020-12-02 12:07:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:07:49,893 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:49,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:49,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:07:49,893 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1154818923, now seen corresponding path program 1 times [2020-12-02 12:07:49,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:49,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158161341] [2020-12-02 12:07:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:50,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158161341] [2020-12-02 12:07:50,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:50,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:07:50,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779370664] [2020-12-02 12:07:50,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:07:50,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:07:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:50,052 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 5 states. [2020-12-02 12:07:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:50,158 INFO L93 Difference]: Finished difference Result 491 states and 1384 transitions. [2020-12-02 12:07:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:07:50,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-02 12:07:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:50,163 INFO L225 Difference]: With dead ends: 491 [2020-12-02 12:07:50,164 INFO L226 Difference]: Without dead ends: 431 [2020-12-02 12:07:50,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-12-02 12:07:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-12-02 12:07:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-12-02 12:07:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-12-02 12:07:50,181 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2020-12-02 12:07:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:50,181 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-12-02 12:07:50,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:07:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-12-02 12:07:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:07:50,183 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:50,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:50,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:07:50,184 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1439607342, now seen corresponding path program 1 times [2020-12-02 12:07:50,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:50,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835722304] [2020-12-02 12:07:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:50,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835722304] [2020-12-02 12:07:50,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:50,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:07:50,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428669400] [2020-12-02 12:07:50,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:07:50,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:07:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:50,318 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 5 states. [2020-12-02 12:07:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:50,442 INFO L93 Difference]: Finished difference Result 483 states and 1369 transitions. [2020-12-02 12:07:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:50,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-02 12:07:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:50,447 INFO L225 Difference]: With dead ends: 483 [2020-12-02 12:07:50,448 INFO L226 Difference]: Without dead ends: 438 [2020-12-02 12:07:50,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-12-02 12:07:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2020-12-02 12:07:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-02 12:07:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1256 transitions. [2020-12-02 12:07:50,466 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1256 transitions. Word has length 14 [2020-12-02 12:07:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:50,466 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1256 transitions. [2020-12-02 12:07:50,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:07:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1256 transitions. [2020-12-02 12:07:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:07:50,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:50,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:50,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:07:50,468 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1439618874, now seen corresponding path program 1 times [2020-12-02 12:07:50,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:50,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041417249] [2020-12-02 12:07:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:50,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041417249] [2020-12-02 12:07:50,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:50,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:07:50,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415706821] [2020-12-02 12:07:50,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:07:50,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:07:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:50,636 INFO L87 Difference]: Start difference. First operand 434 states and 1256 transitions. Second operand 6 states. [2020-12-02 12:07:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:50,751 INFO L93 Difference]: Finished difference Result 514 states and 1456 transitions. [2020-12-02 12:07:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:50,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 12:07:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:50,757 INFO L225 Difference]: With dead ends: 514 [2020-12-02 12:07:50,757 INFO L226 Difference]: Without dead ends: 462 [2020-12-02 12:07:50,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2020-12-02 12:07:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2020-12-02 12:07:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-12-02 12:07:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1336 transitions. [2020-12-02 12:07:50,774 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1336 transitions. Word has length 14 [2020-12-02 12:07:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:50,775 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 1336 transitions. [2020-12-02 12:07:50,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:07:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1336 transitions. [2020-12-02 12:07:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:07:50,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:50,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:50,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:07:50,777 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:50,778 INFO L82 PathProgramCache]: Analyzing trace with hash -298495698, now seen corresponding path program 2 times [2020-12-02 12:07:50,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:50,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442219829] [2020-12-02 12:07:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:50,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442219829] [2020-12-02 12:07:50,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:50,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:07:50,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674077471] [2020-12-02 12:07:50,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:07:50,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:50,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:07:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:50,861 INFO L87 Difference]: Start difference. First operand 462 states and 1336 transitions. Second operand 6 states. [2020-12-02 12:07:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:51,004 INFO L93 Difference]: Finished difference Result 513 states and 1451 transitions. [2020-12-02 12:07:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:07:51,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 12:07:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:51,009 INFO L225 Difference]: With dead ends: 513 [2020-12-02 12:07:51,009 INFO L226 Difference]: Without dead ends: 466 [2020-12-02 12:07:51,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-12-02 12:07:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2020-12-02 12:07:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-12-02 12:07:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1339 transitions. [2020-12-02 12:07:51,027 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1339 transitions. Word has length 14 [2020-12-02 12:07:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:51,027 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 1339 transitions. [2020-12-02 12:07:51,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:07:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1339 transitions. [2020-12-02 12:07:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:07:51,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:51,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:51,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:07:51,030 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1678114700, now seen corresponding path program 1 times [2020-12-02 12:07:51,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:51,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690269909] [2020-12-02 12:07:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:51,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690269909] [2020-12-02 12:07:51,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:51,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:07:51,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459631993] [2020-12-02 12:07:51,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:07:51,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:07:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:51,148 INFO L87 Difference]: Start difference. First operand 463 states and 1339 transitions. Second operand 6 states. [2020-12-02 12:07:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:51,305 INFO L93 Difference]: Finished difference Result 685 states and 1895 transitions. [2020-12-02 12:07:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:51,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:07:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:51,311 INFO L225 Difference]: With dead ends: 685 [2020-12-02 12:07:51,311 INFO L226 Difference]: Without dead ends: 573 [2020-12-02 12:07:51,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-12-02 12:07:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 513. [2020-12-02 12:07:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-12-02 12:07:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1454 transitions. [2020-12-02 12:07:51,330 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1454 transitions. Word has length 15 [2020-12-02 12:07:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:51,330 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1454 transitions. [2020-12-02 12:07:51,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:07:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1454 transitions. [2020-12-02 12:07:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:07:51,332 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:51,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:51,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:07:51,333 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1678107973, now seen corresponding path program 1 times [2020-12-02 12:07:51,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:51,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846989252] [2020-12-02 12:07:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:51,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846989252] [2020-12-02 12:07:51,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:51,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:07:51,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637495089] [2020-12-02 12:07:51,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:07:51,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:07:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:51,432 INFO L87 Difference]: Start difference. First operand 513 states and 1454 transitions. Second operand 6 states. [2020-12-02 12:07:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:51,661 INFO L93 Difference]: Finished difference Result 563 states and 1581 transitions. [2020-12-02 12:07:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 12:07:51,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-02 12:07:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:51,667 INFO L225 Difference]: With dead ends: 563 [2020-12-02 12:07:51,667 INFO L226 Difference]: Without dead ends: 533 [2020-12-02 12:07:51,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-02 12:07:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-12-02 12:07:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 521. [2020-12-02 12:07:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-12-02 12:07:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1478 transitions. [2020-12-02 12:07:51,685 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1478 transitions. Word has length 15 [2020-12-02 12:07:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:51,686 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 1478 transitions. [2020-12-02 12:07:51,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:07:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1478 transitions. [2020-12-02 12:07:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:07:51,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:51,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:51,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:07:51,688 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1678465465, now seen corresponding path program 1 times [2020-12-02 12:07:51,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:51,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42298096] [2020-12-02 12:07:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:51,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42298096] [2020-12-02 12:07:51,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:51,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:07:51,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718954397] [2020-12-02 12:07:51,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:07:51,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:07:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:07:51,817 INFO L87 Difference]: Start difference. First operand 521 states and 1478 transitions. Second operand 7 states. [2020-12-02 12:07:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:51,962 INFO L93 Difference]: Finished difference Result 545 states and 1518 transitions. [2020-12-02 12:07:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:51,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-02 12:07:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:51,967 INFO L225 Difference]: With dead ends: 545 [2020-12-02 12:07:51,968 INFO L226 Difference]: Without dead ends: 513 [2020-12-02 12:07:51,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-12-02 12:07:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 481. [2020-12-02 12:07:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-12-02 12:07:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1354 transitions. [2020-12-02 12:07:51,985 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1354 transitions. Word has length 15 [2020-12-02 12:07:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:51,986 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 1354 transitions. [2020-12-02 12:07:51,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:07:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1354 transitions. [2020-12-02 12:07:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:07:51,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:51,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:51,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:07:51,988 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 481901479, now seen corresponding path program 1 times [2020-12-02 12:07:51,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:51,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278161973] [2020-12-02 12:07:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:52,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278161973] [2020-12-02 12:07:52,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:52,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:07:52,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939575122] [2020-12-02 12:07:52,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:07:52,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:07:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:07:52,140 INFO L87 Difference]: Start difference. First operand 481 states and 1354 transitions. Second operand 7 states. [2020-12-02 12:07:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:52,283 INFO L93 Difference]: Finished difference Result 496 states and 1378 transitions. [2020-12-02 12:07:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:52,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-02 12:07:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:52,289 INFO L225 Difference]: With dead ends: 496 [2020-12-02 12:07:52,289 INFO L226 Difference]: Without dead ends: 476 [2020-12-02 12:07:52,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2020-12-02 12:07:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 473. [2020-12-02 12:07:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-12-02 12:07:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1330 transitions. [2020-12-02 12:07:52,308 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1330 transitions. Word has length 16 [2020-12-02 12:07:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:52,308 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 1330 transitions. [2020-12-02 12:07:52,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:07:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1330 transitions. [2020-12-02 12:07:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:07:52,310 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:52,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:52,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 12:07:52,311 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash 482229180, now seen corresponding path program 1 times [2020-12-02 12:07:52,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:52,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35547124] [2020-12-02 12:07:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:52,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35547124] [2020-12-02 12:07:52,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:52,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:07:52,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891594421] [2020-12-02 12:07:52,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:07:52,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:52,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:07:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:07:52,416 INFO L87 Difference]: Start difference. First operand 473 states and 1330 transitions. Second operand 7 states. [2020-12-02 12:07:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:52,582 INFO L93 Difference]: Finished difference Result 550 states and 1539 transitions. [2020-12-02 12:07:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:07:52,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-02 12:07:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:52,587 INFO L225 Difference]: With dead ends: 550 [2020-12-02 12:07:52,587 INFO L226 Difference]: Without dead ends: 526 [2020-12-02 12:07:52,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-12-02 12:07:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 480. [2020-12-02 12:07:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-12-02 12:07:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1355 transitions. [2020-12-02 12:07:52,605 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1355 transitions. Word has length 16 [2020-12-02 12:07:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:52,605 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 1355 transitions. [2020-12-02 12:07:52,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:07:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1355 transitions. [2020-12-02 12:07:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:07:52,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:52,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:52,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 12:07:52,608 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 492953940, now seen corresponding path program 2 times [2020-12-02 12:07:52,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:52,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536587654] [2020-12-02 12:07:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:52,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536587654] [2020-12-02 12:07:52,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:52,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:07:52,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789786842] [2020-12-02 12:07:52,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 12:07:52,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 12:07:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:07:52,713 INFO L87 Difference]: Start difference. First operand 480 states and 1355 transitions. Second operand 7 states. [2020-12-02 12:07:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:52,848 INFO L93 Difference]: Finished difference Result 524 states and 1453 transitions. [2020-12-02 12:07:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:52,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-02 12:07:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:52,853 INFO L225 Difference]: With dead ends: 524 [2020-12-02 12:07:52,853 INFO L226 Difference]: Without dead ends: 496 [2020-12-02 12:07:52,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2020-12-02 12:07:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 465. [2020-12-02 12:07:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-12-02 12:07:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1296 transitions. [2020-12-02 12:07:52,869 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1296 transitions. Word has length 16 [2020-12-02 12:07:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:52,869 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 1296 transitions. [2020-12-02 12:07:52,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 12:07:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1296 transitions. [2020-12-02 12:07:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:07:52,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:52,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:52,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 12:07:52,872 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 492530139, now seen corresponding path program 1 times [2020-12-02 12:07:52,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:52,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175723539] [2020-12-02 12:07:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:52,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175723539] [2020-12-02 12:07:52,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:52,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:07:52,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741927335] [2020-12-02 12:07:52,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:07:52,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:07:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:07:52,923 INFO L87 Difference]: Start difference. First operand 465 states and 1296 transitions. Second operand 4 states. [2020-12-02 12:07:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:52,955 INFO L93 Difference]: Finished difference Result 733 states and 2009 transitions. [2020-12-02 12:07:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 12:07:52,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-02 12:07:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:52,960 INFO L225 Difference]: With dead ends: 733 [2020-12-02 12:07:52,960 INFO L226 Difference]: Without dead ends: 421 [2020-12-02 12:07:52,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-02 12:07:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 397. [2020-12-02 12:07:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-12-02 12:07:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1042 transitions. [2020-12-02 12:07:52,974 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1042 transitions. Word has length 16 [2020-12-02 12:07:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:52,975 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 1042 transitions. [2020-12-02 12:07:52,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:07:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1042 transitions. [2020-12-02 12:07:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:07:52,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:52,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:52,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 12:07:52,977 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1222661999, now seen corresponding path program 2 times [2020-12-02 12:07:52,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:52,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577304541] [2020-12-02 12:07:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:53,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577304541] [2020-12-02 12:07:53,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:53,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:07:53,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207619485] [2020-12-02 12:07:53,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:07:53,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:07:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:07:53,042 INFO L87 Difference]: Start difference. First operand 397 states and 1042 transitions. Second operand 4 states. [2020-12-02 12:07:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:53,077 INFO L93 Difference]: Finished difference Result 392 states and 913 transitions. [2020-12-02 12:07:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:07:53,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-02 12:07:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:53,080 INFO L225 Difference]: With dead ends: 392 [2020-12-02 12:07:53,081 INFO L226 Difference]: Without dead ends: 299 [2020-12-02 12:07:53,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-02 12:07:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2020-12-02 12:07:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-02 12:07:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 690 transitions. [2020-12-02 12:07:53,091 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 690 transitions. Word has length 16 [2020-12-02 12:07:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:53,091 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 690 transitions. [2020-12-02 12:07:53,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:07:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 690 transitions. [2020-12-02 12:07:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 12:07:53,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:53,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:53,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 12:07:53,093 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1411500507, now seen corresponding path program 1 times [2020-12-02 12:07:53,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:53,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000807642] [2020-12-02 12:07:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:53,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000807642] [2020-12-02 12:07:53,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:53,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:07:53,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097932357] [2020-12-02 12:07:53,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:07:53,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:07:53,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:07:53,189 INFO L87 Difference]: Start difference. First operand 299 states and 690 transitions. Second operand 5 states. [2020-12-02 12:07:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:53,237 INFO L93 Difference]: Finished difference Result 245 states and 505 transitions. [2020-12-02 12:07:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:53,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-02 12:07:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:53,240 INFO L225 Difference]: With dead ends: 245 [2020-12-02 12:07:53,240 INFO L226 Difference]: Without dead ends: 193 [2020-12-02 12:07:53,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-02 12:07:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2020-12-02 12:07:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-02 12:07:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 388 transitions. [2020-12-02 12:07:53,247 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 388 transitions. Word has length 17 [2020-12-02 12:07:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:53,247 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 388 transitions. [2020-12-02 12:07:53,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:07:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 388 transitions. [2020-12-02 12:07:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:53,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:53,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:53,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 12:07:53,249 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2024555249, now seen corresponding path program 1 times [2020-12-02 12:07:53,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:53,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340170373] [2020-12-02 12:07:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:53,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340170373] [2020-12-02 12:07:53,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:53,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 12:07:53,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096381359] [2020-12-02 12:07:53,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 12:07:53,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 12:07:53,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:53,449 INFO L87 Difference]: Start difference. First operand 193 states and 388 transitions. Second operand 9 states. [2020-12-02 12:07:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:53,578 INFO L93 Difference]: Finished difference Result 208 states and 406 transitions. [2020-12-02 12:07:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:07:53,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-02 12:07:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:53,581 INFO L225 Difference]: With dead ends: 208 [2020-12-02 12:07:53,581 INFO L226 Difference]: Without dead ends: 202 [2020-12-02 12:07:53,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-02 12:07:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2020-12-02 12:07:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-02 12:07:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 386 transitions. [2020-12-02 12:07:53,587 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 386 transitions. Word has length 19 [2020-12-02 12:07:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:53,588 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 386 transitions. [2020-12-02 12:07:53,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 12:07:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 386 transitions. [2020-12-02 12:07:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:53,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:53,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:53,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 12:07:53,589 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2025794939, now seen corresponding path program 2 times [2020-12-02 12:07:53,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:53,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848372859] [2020-12-02 12:07:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:53,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848372859] [2020-12-02 12:07:53,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:53,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:07:53,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683967283] [2020-12-02 12:07:53,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:07:53,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:07:53,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:53,814 INFO L87 Difference]: Start difference. First operand 192 states and 386 transitions. Second operand 8 states. [2020-12-02 12:07:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:54,047 INFO L93 Difference]: Finished difference Result 207 states and 404 transitions. [2020-12-02 12:07:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:07:54,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-12-02 12:07:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:54,049 INFO L225 Difference]: With dead ends: 207 [2020-12-02 12:07:54,049 INFO L226 Difference]: Without dead ends: 192 [2020-12-02 12:07:54,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-02 12:07:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-02 12:07:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2020-12-02 12:07:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-02 12:07:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 372 transitions. [2020-12-02 12:07:54,055 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 372 transitions. Word has length 19 [2020-12-02 12:07:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:54,056 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 372 transitions. [2020-12-02 12:07:54,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:07:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 372 transitions. [2020-12-02 12:07:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:54,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:54,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:54,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-02 12:07:54,058 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1049838257, now seen corresponding path program 3 times [2020-12-02 12:07:54,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:54,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429084961] [2020-12-02 12:07:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:54,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429084961] [2020-12-02 12:07:54,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:54,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 12:07:54,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429582891] [2020-12-02 12:07:54,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 12:07:54,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 12:07:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:54,248 INFO L87 Difference]: Start difference. First operand 187 states and 372 transitions. Second operand 9 states. [2020-12-02 12:07:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:54,448 INFO L93 Difference]: Finished difference Result 202 states and 390 transitions. [2020-12-02 12:07:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:07:54,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-02 12:07:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:54,451 INFO L225 Difference]: With dead ends: 202 [2020-12-02 12:07:54,451 INFO L226 Difference]: Without dead ends: 188 [2020-12-02 12:07:54,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-02 12:07:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-02 12:07:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2020-12-02 12:07:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-12-02 12:07:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions. [2020-12-02 12:07:54,458 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 19 [2020-12-02 12:07:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:54,458 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 368 transitions. [2020-12-02 12:07:54,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 12:07:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions. [2020-12-02 12:07:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:54,459 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:54,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:54,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-02 12:07:54,460 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1534850081, now seen corresponding path program 4 times [2020-12-02 12:07:54,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:54,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625306658] [2020-12-02 12:07:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:54,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625306658] [2020-12-02 12:07:54,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:54,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:07:54,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307867314] [2020-12-02 12:07:54,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:07:54,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:54,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:07:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:54,632 INFO L87 Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 8 states. [2020-12-02 12:07:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:54,831 INFO L93 Difference]: Finished difference Result 197 states and 381 transitions. [2020-12-02 12:07:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:07:54,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-12-02 12:07:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:54,833 INFO L225 Difference]: With dead ends: 197 [2020-12-02 12:07:54,833 INFO L226 Difference]: Without dead ends: 183 [2020-12-02 12:07:54,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 12:07:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-02 12:07:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-12-02 12:07:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-02 12:07:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 364 transitions. [2020-12-02 12:07:54,840 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 364 transitions. Word has length 19 [2020-12-02 12:07:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:54,842 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 364 transitions. [2020-12-02 12:07:54,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:07:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 364 transitions. [2020-12-02 12:07:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:54,843 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:54,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:54,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-02 12:07:54,844 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -445266509, now seen corresponding path program 5 times [2020-12-02 12:07:54,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:54,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665951319] [2020-12-02 12:07:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:55,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665951319] [2020-12-02 12:07:55,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:55,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:07:55,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256365254] [2020-12-02 12:07:55,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:07:55,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:07:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:07:55,065 INFO L87 Difference]: Start difference. First operand 183 states and 364 transitions. Second operand 8 states. [2020-12-02 12:07:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:55,193 INFO L93 Difference]: Finished difference Result 198 states and 382 transitions. [2020-12-02 12:07:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:07:55,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-12-02 12:07:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:55,196 INFO L225 Difference]: With dead ends: 198 [2020-12-02 12:07:55,197 INFO L226 Difference]: Without dead ends: 182 [2020-12-02 12:07:55,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-02 12:07:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-12-02 12:07:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-02 12:07:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 362 transitions. [2020-12-02 12:07:55,203 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 362 transitions. Word has length 19 [2020-12-02 12:07:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:55,204 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 362 transitions. [2020-12-02 12:07:55,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:07:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 362 transitions. [2020-12-02 12:07:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:55,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:55,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:55,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-02 12:07:55,206 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1706155803, now seen corresponding path program 6 times [2020-12-02 12:07:55,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:55,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161180152] [2020-12-02 12:07:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:55,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161180152] [2020-12-02 12:07:55,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:55,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 12:07:55,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417984648] [2020-12-02 12:07:55,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 12:07:55,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 12:07:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:07:55,391 INFO L87 Difference]: Start difference. First operand 182 states and 362 transitions. Second operand 9 states. [2020-12-02 12:07:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:55,633 INFO L93 Difference]: Finished difference Result 208 states and 399 transitions. [2020-12-02 12:07:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:07:55,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-02 12:07:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:55,635 INFO L225 Difference]: With dead ends: 208 [2020-12-02 12:07:55,635 INFO L226 Difference]: Without dead ends: 145 [2020-12-02 12:07:55,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-12-02 12:07:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-02 12:07:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2020-12-02 12:07:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-02 12:07:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2020-12-02 12:07:55,640 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2020-12-02 12:07:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:55,641 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2020-12-02 12:07:55,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 12:07:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2020-12-02 12:07:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 12:07:55,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:55,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:55,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-02 12:07:55,642 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1211997573, now seen corresponding path program 1 times [2020-12-02 12:07:55,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:55,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188508312] [2020-12-02 12:07:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:07:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:07:55,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188508312] [2020-12-02 12:07:55,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:07:55,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:07:55,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433955008] [2020-12-02 12:07:55,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:07:55,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:07:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:07:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:07:55,722 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2020-12-02 12:07:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:07:55,770 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2020-12-02 12:07:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:07:55,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 12:07:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:07:55,771 INFO L225 Difference]: With dead ends: 112 [2020-12-02 12:07:55,772 INFO L226 Difference]: Without dead ends: 63 [2020-12-02 12:07:55,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:07:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-02 12:07:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-02 12:07:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-02 12:07:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-12-02 12:07:55,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-12-02 12:07:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:07:55,775 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-12-02 12:07:55,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:07:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-12-02 12:07:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 12:07:55,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:07:55,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:07:55,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-02 12:07:55,776 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:07:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:07:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2124764362, now seen corresponding path program 1 times [2020-12-02 12:07:55,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:07:55,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444839772] [2020-12-02 12:07:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:07:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:07:55,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:07:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:07:55,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:07:55,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:07:55,929 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:07:55,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-02 12:07:56,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:07:56 BasicIcfg [2020-12-02 12:07:56,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:07:56,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:07:56,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:07:56,064 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:07:56,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:07:34" (3/4) ... [2020-12-02 12:07:56,067 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:07:56,180 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:07:56,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:07:56,182 INFO L168 Benchmark]: Toolchain (without parser) took 24686.34 ms. Allocated memory was 41.9 MB in the beginning and 325.1 MB in the end (delta: 283.1 MB). Free memory was 18.5 MB in the beginning and 211.1 MB in the end (delta: -192.6 MB). Peak memory consumption was 92.3 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,182 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 41.9 MB. Free memory was 22.7 MB in the beginning and 22.7 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:07:56,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.35 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.2 MB in the beginning and 23.1 MB in the end (delta: -4.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 50.3 MB. Free memory was 23.1 MB in the beginning and 32.0 MB in the end (delta: -8.9 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,184 INFO L168 Benchmark]: Boogie Preprocessor took 48.01 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 29.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,184 INFO L168 Benchmark]: RCFGBuilder took 2442.12 ms. Allocated memory was 50.3 MB in the beginning and 73.4 MB in the end (delta: 23.1 MB). Free memory was 29.7 MB in the beginning and 27.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,185 INFO L168 Benchmark]: TraceAbstraction took 21131.71 ms. Allocated memory was 73.4 MB in the beginning and 325.1 MB in the end (delta: 251.7 MB). Free memory was 26.9 MB in the beginning and 223.7 MB in the end (delta: -196.8 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,185 INFO L168 Benchmark]: Witness Printer took 117.59 ms. Allocated memory is still 325.1 MB. Free memory was 223.7 MB in the beginning and 211.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-02 12:07:56,187 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.22 ms. Allocated memory is still 41.9 MB. Free memory was 22.7 MB in the beginning and 22.7 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 855.35 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.2 MB in the beginning and 23.1 MB in the end (delta: -4.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 50.3 MB. Free memory was 23.1 MB in the beginning and 32.0 MB in the end (delta: -8.9 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.01 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 29.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2442.12 ms. Allocated memory was 50.3 MB in the beginning and 73.4 MB in the end (delta: 23.1 MB). Free memory was 29.7 MB in the beginning and 27.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21131.71 ms. Allocated memory was 73.4 MB in the beginning and 325.1 MB in the end (delta: 251.7 MB). Free memory was 26.9 MB in the beginning and 223.7 MB in the end (delta: -196.8 MB). Peak memory consumption was 55.9 MB. Max. memory is 16.1 GB. * Witness Printer took 117.59 ms. Allocated memory is still 325.1 MB. Free memory was 223.7 MB in the beginning and 211.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1201 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 159 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.4s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4814 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.8s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.5s, HoareTripleCheckerStatistics: 621 SDtfs, 727 SDslu, 1572 SDs, 0 SdLazy, 949 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 247 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 53188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...