./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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/ldv-races/race-3_1-container_of-global.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 dd263d20067137356e96cf6640993a49b235f8dc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 00:35:37,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:35:37,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:35:37,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:35:37,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:35:37,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:35:37,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:35:37,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:35:37,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:35:37,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:35:37,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:35:37,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:35:37,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:35:37,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:35:37,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:35:37,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:35:37,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:35:37,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:35:37,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:35:37,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:35:37,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:35:37,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:35:37,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:35:37,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:35:37,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:35:37,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:35:37,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:35:37,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:35:37,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:35:37,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:35:37,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:35:37,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:35:37,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:35:37,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:35:37,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:35:37,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:35:37,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:35:37,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:35:37,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:35:37,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:35:37,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:35:37,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:35:37,929 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:35:37,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:35:37,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:35:37,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:35:37,932 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:35:37,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:35:37,932 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:35:37,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:35:37,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:35:37,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:35:37,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:35:37,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:35:37,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:35:37,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:35:37,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:35:37,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:35:37,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:35:37,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:35:37,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:35:37,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:35:37,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:35:37,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:35:37,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:35:37,946 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:35:37,946 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 -> dd263d20067137356e96cf6640993a49b235f8dc [2020-10-26 00:35:38,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:35:38,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:35:38,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:35:38,427 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:35:38,428 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:35:38,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2020-10-26 00:35:38,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8a385b4/6ff0540ce0394c708d9a8a9f040948cb/FLAG1e43ab428 [2020-10-26 00:35:39,371 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:35:39,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2020-10-26 00:35:39,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8a385b4/6ff0540ce0394c708d9a8a9f040948cb/FLAG1e43ab428 [2020-10-26 00:35:39,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8a385b4/6ff0540ce0394c708d9a8a9f040948cb [2020-10-26 00:35:39,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:35:39,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:35:39,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:35:39,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:35:39,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:35:39,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:35:39" (1/1) ... [2020-10-26 00:35:39,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afeda62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:39, skipping insertion in model container [2020-10-26 00:35:39,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:35:39" (1/1) ... [2020-10-26 00:35:39,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:35:39,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:35:40,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:35:40,798 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:35:40,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:35:41,381 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:35:41,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41 WrapperNode [2020-10-26 00:35:41,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:35:41,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:35:41,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:35:41,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:35:41,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:35:41,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:35:41,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:35:41,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:35:41,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... [2020-10-26 00:35:41,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:35:41,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:35:41,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:35:41,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:35:41,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:35:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:35:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 00:35:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-26 00:35:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-26 00:35:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:35:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:35:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-26 00:35:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-26 00:35:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:35:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:35:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:35:41,666 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:35:42,561 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:35:42,562 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-10-26 00:35:42,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:35:42 BoogieIcfgContainer [2020-10-26 00:35:42,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:35:42,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:35:42,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:35:42,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:35:42,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:35:39" (1/3) ... [2020-10-26 00:35:42,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b882295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:35:42, skipping insertion in model container [2020-10-26 00:35:42,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:35:41" (2/3) ... [2020-10-26 00:35:42,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b882295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:35:42, skipping insertion in model container [2020-10-26 00:35:42,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:35:42" (3/3) ... [2020-10-26 00:35:42,574 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-26 00:35:42,586 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:35:42,587 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:35:42,599 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-26 00:35:42,600 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:35:42,644 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,645 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,645 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,645 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,645 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,646 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,646 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,646 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,646 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,647 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,647 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,647 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,647 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,648 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,648 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,650 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,650 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,650 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,650 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,651 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,651 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,651 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,652 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,652 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,652 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,653 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,656 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,656 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,660 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,662 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,663 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,664 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,664 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,665 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,671 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:35:42,687 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-10-26 00:35:42,702 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-26 00:35:42,727 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:35:42,728 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:35:42,728 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:35:42,728 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:35:42,745 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:35:42,745 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:35:42,745 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:35:42,746 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:35:42,770 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:35:42,773 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-26 00:35:42,780 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 188 transitions, 398 flow [2020-10-26 00:35:42,782 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 178 places, 188 transitions, 398 flow [2020-10-26 00:35:42,927 INFO L129 PetriNetUnfolder]: 19/236 cut-off events. [2020-10-26 00:35:42,928 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-26 00:35:42,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 236 events. 19/236 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 492 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-10-26 00:35:42,941 INFO L116 LiptonReduction]: Number of co-enabled transitions 3172 [2020-10-26 00:35:44,571 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:44,605 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:44,627 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-26 00:35:44,644 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:44,673 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:44,695 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:44,696 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-26 00:35:47,277 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:47,314 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:47,343 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,344 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-26 00:35:47,359 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:47,394 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:47,419 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:47,420 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-26 00:35:49,720 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:49,755 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:49,781 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,782 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-26 00:35:49,796 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:49,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:49,848 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:49,848 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-26 00:35:52,324 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,350 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:52,355 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:52,385 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-26 00:35:52,400 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:52,444 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:52,467 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:52,468 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-26 00:35:54,988 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:55,019 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:55,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-26 00:35:55,059 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:55,089 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:55,110 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:55,110 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-26 00:35:58,176 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:58,215 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:58,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,267 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-10-26 00:35:58,286 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:58,332 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:35:58,365 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:35:58,366 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-10-26 00:36:00,415 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:00,442 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:00,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,460 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-26 00:36:00,470 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:00,501 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:00,522 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:00,522 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-26 00:36:03,154 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-10-26 00:36:03,469 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:03,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:03,502 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:03,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:03,526 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:03,527 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-26 00:36:03,915 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-26 00:36:04,025 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-26 00:36:04,410 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-10-26 00:36:04,426 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:04,530 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-10-26 00:36:04,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:04,537 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:04,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:04,639 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:04,639 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:160, output treesize:132 [2020-10-26 00:36:05,702 WARN L193 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-26 00:36:06,103 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-26 00:36:06,356 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-10-26 00:36:07,677 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-10-26 00:36:08,066 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-26 00:36:09,476 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2020-10-26 00:36:09,519 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:10,300 WARN L193 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-26 00:36:10,301 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:10,312 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:11,046 WARN L193 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-26 00:36:11,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 00:36:11,048 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 00:36:11,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-10-26 00:36:11,827 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-10-26 00:36:11,839 INFO L131 LiptonReduction]: Checked pairs total: 8034 [2020-10-26 00:36:11,839 INFO L133 LiptonReduction]: Total number of compositions: 229 [2020-10-26 00:36:11,845 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-10-26 00:36:11,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-10-26 00:36:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-10-26 00:36:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-26 00:36:11,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:11,910 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-26 00:36:11,910 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash 711, now seen corresponding path program 1 times [2020-10-26 00:36:11,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:11,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545445136] [2020-10-26 00:36:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:12,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545445136] [2020-10-26 00:36:12,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:12,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-26 00:36:12,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663742361] [2020-10-26 00:36:12,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-26 00:36:12,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 00:36:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 00:36:12,285 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-10-26 00:36:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:12,330 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-10-26 00:36:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 00:36:12,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-26 00:36:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:12,350 INFO L225 Difference]: With dead ends: 423 [2020-10-26 00:36:12,351 INFO L226 Difference]: Without dead ends: 385 [2020-10-26 00:36:12,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 00:36:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-26 00:36:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-10-26 00:36:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-26 00:36:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-10-26 00:36:12,449 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-10-26 00:36:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:12,449 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-10-26 00:36:12,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-26 00:36:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-10-26 00:36:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-26 00:36:12,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:12,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-26 00:36:12,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:36:12,451 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 21756108, now seen corresponding path program 1 times [2020-10-26 00:36:12,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:12,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147634182] [2020-10-26 00:36:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:12,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147634182] [2020-10-26 00:36:12,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:12,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:36:12,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755834954] [2020-10-26 00:36:12,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:36:12,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:36:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:36:12,720 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-10-26 00:36:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:12,875 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-10-26 00:36:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:36:12,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-26 00:36:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:12,882 INFO L225 Difference]: With dead ends: 540 [2020-10-26 00:36:12,883 INFO L226 Difference]: Without dead ends: 540 [2020-10-26 00:36:12,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:36:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-10-26 00:36:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-10-26 00:36:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-26 00:36:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-10-26 00:36:12,935 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-10-26 00:36:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:12,936 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-10-26 00:36:12,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:36:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-10-26 00:36:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-26 00:36:12,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:12,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-26 00:36:12,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:36:12,940 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash -567208386, now seen corresponding path program 1 times [2020-10-26 00:36:12,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:12,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484829238] [2020-10-26 00:36:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:13,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484829238] [2020-10-26 00:36:13,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:13,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:36:13,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686716748] [2020-10-26 00:36:13,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:36:13,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:36:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:36:13,067 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-10-26 00:36:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:13,278 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-10-26 00:36:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:36:13,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-26 00:36:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:13,285 INFO L225 Difference]: With dead ends: 599 [2020-10-26 00:36:13,285 INFO L226 Difference]: Without dead ends: 514 [2020-10-26 00:36:13,286 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-10-26 00:36:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-26 00:36:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-10-26 00:36:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-26 00:36:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-10-26 00:36:13,317 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-10-26 00:36:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:13,317 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-10-26 00:36:13,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:36:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-10-26 00:36:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:36:13,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:13,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:36:13,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:36:13,321 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash 164889039, now seen corresponding path program 1 times [2020-10-26 00:36:13,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:13,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443661119] [2020-10-26 00:36:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:13,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-10-26 00:36:13,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443661119] [2020-10-26 00:36:13,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:13,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:36:13,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30306494] [2020-10-26 00:36:13,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:36:13,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:13,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:36:13,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:36:13,449 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-10-26 00:36:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:13,475 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-26 00:36:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:36:13,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-26 00:36:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:13,481 INFO L225 Difference]: With dead ends: 162 [2020-10-26 00:36:13,481 INFO L226 Difference]: Without dead ends: 162 [2020-10-26 00:36:13,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:36:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-26 00:36:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-26 00:36:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-26 00:36:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-26 00:36:13,487 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-26 00:36:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:13,491 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-26 00:36:13,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:36:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-26 00:36:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:13,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:13,496 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-10-26 00:36:13,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:36:13,496 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash -976645078, now seen corresponding path program 1 times [2020-10-26 00:36:13,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:13,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286863495] [2020-10-26 00:36:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:13,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286863495] [2020-10-26 00:36:13,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:13,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 00:36:13,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372761937] [2020-10-26 00:36:13,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-26 00:36:13,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 00:36:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-26 00:36:13,865 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-10-26 00:36:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:14,427 INFO L93 Difference]: Finished difference Result 144 states and 313 transitions. [2020-10-26 00:36:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 00:36:14,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-26 00:36:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:14,429 INFO L225 Difference]: With dead ends: 144 [2020-10-26 00:36:14,429 INFO L226 Difference]: Without dead ends: 144 [2020-10-26 00:36:14,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-26 00:36:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-26 00:36:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-26 00:36:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 313 transitions. [2020-10-26 00:36:14,436 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 313 transitions. Word has length 22 [2020-10-26 00:36:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:14,436 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 313 transitions. [2020-10-26 00:36:14,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-26 00:36:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 313 transitions. [2020-10-26 00:36:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:14,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:14,440 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-10-26 00:36:14,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:36:14,441 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash -834725520, now seen corresponding path program 1 times [2020-10-26 00:36:14,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:14,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787332176] [2020-10-26 00:36:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:14,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787332176] [2020-10-26 00:36:14,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:14,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:36:14,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944635142] [2020-10-26 00:36:14,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:36:14,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:14,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:36:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:36:14,651 INFO L87 Difference]: Start difference. First operand 144 states and 313 transitions. Second operand 4 states. [2020-10-26 00:36:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:14,681 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2020-10-26 00:36:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:36:14,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-26 00:36:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:14,683 INFO L225 Difference]: With dead ends: 96 [2020-10-26 00:36:14,683 INFO L226 Difference]: Without dead ends: 96 [2020-10-26 00:36:14,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:36:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-26 00:36:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-26 00:36:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-26 00:36:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2020-10-26 00:36:14,687 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 161 transitions. Word has length 22 [2020-10-26 00:36:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:14,687 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 161 transitions. [2020-10-26 00:36:14,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:36:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 161 transitions. [2020-10-26 00:36:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:14,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:14,688 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-10-26 00:36:14,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:36:14,689 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 663150838, now seen corresponding path program 2 times [2020-10-26 00:36:14,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:14,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222822033] [2020-10-26 00:36:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:15,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222822033] [2020-10-26 00:36:15,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:15,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-26 00:36:15,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114308838] [2020-10-26 00:36:15,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 00:36:15,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 00:36:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:15,754 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand 11 states. [2020-10-26 00:36:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:16,470 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2020-10-26 00:36:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 00:36:16,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-26 00:36:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:16,472 INFO L225 Difference]: With dead ends: 128 [2020-10-26 00:36:16,472 INFO L226 Difference]: Without dead ends: 128 [2020-10-26 00:36:16,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-10-26 00:36:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-26 00:36:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2020-10-26 00:36:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-26 00:36:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 210 transitions. [2020-10-26 00:36:16,477 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 210 transitions. Word has length 22 [2020-10-26 00:36:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:16,478 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 210 transitions. [2020-10-26 00:36:16,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 00:36:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2020-10-26 00:36:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:16,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:16,479 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-10-26 00:36:16,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:36:16,479 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 663150822, now seen corresponding path program 1 times [2020-10-26 00:36:16,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:16,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928302652] [2020-10-26 00:36:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:16,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928302652] [2020-10-26 00:36:16,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:16,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:16,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956876115] [2020-10-26 00:36:16,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:16,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:16,839 INFO L87 Difference]: Start difference. First operand 127 states and 210 transitions. Second operand 8 states. [2020-10-26 00:36:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:17,187 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2020-10-26 00:36:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:36:17,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:17,189 INFO L225 Difference]: With dead ends: 164 [2020-10-26 00:36:17,189 INFO L226 Difference]: Without dead ends: 136 [2020-10-26 00:36:17,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-26 00:36:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-10-26 00:36:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-26 00:36:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 200 transitions. [2020-10-26 00:36:17,194 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 200 transitions. Word has length 22 [2020-10-26 00:36:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:17,194 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 200 transitions. [2020-10-26 00:36:17,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 200 transitions. [2020-10-26 00:36:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:17,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:17,195 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-10-26 00:36:17,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:36:17,196 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -917977872, now seen corresponding path program 3 times [2020-10-26 00:36:17,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:17,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811742951] [2020-10-26 00:36:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:17,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811742951] [2020-10-26 00:36:17,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:17,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-26 00:36:17,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123034431] [2020-10-26 00:36:17,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 00:36:17,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 00:36:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:17,974 INFO L87 Difference]: Start difference. First operand 121 states and 200 transitions. Second operand 11 states. [2020-10-26 00:36:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:18,720 INFO L93 Difference]: Finished difference Result 189 states and 307 transitions. [2020-10-26 00:36:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 00:36:18,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-26 00:36:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:18,723 INFO L225 Difference]: With dead ends: 189 [2020-10-26 00:36:18,723 INFO L226 Difference]: Without dead ends: 189 [2020-10-26 00:36:18,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-10-26 00:36:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2020-10-26 00:36:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-26 00:36:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 242 transitions. [2020-10-26 00:36:18,733 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 242 transitions. Word has length 22 [2020-10-26 00:36:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:18,733 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 242 transitions. [2020-10-26 00:36:18,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 00:36:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 242 transitions. [2020-10-26 00:36:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:18,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:18,734 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-10-26 00:36:18,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:36:18,735 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash -917977888, now seen corresponding path program 2 times [2020-10-26 00:36:18,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:18,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294108564] [2020-10-26 00:36:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:19,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294108564] [2020-10-26 00:36:19,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:19,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:19,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278211938] [2020-10-26 00:36:19,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:19,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:19,058 INFO L87 Difference]: Start difference. First operand 147 states and 242 transitions. Second operand 8 states. [2020-10-26 00:36:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:19,411 INFO L93 Difference]: Finished difference Result 195 states and 303 transitions. [2020-10-26 00:36:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:36:19,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:19,414 INFO L225 Difference]: With dead ends: 195 [2020-10-26 00:36:19,414 INFO L226 Difference]: Without dead ends: 181 [2020-10-26 00:36:19,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-26 00:36:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2020-10-26 00:36:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-26 00:36:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-26 00:36:19,419 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-26 00:36:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:19,420 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-26 00:36:19,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-26 00:36:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:19,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:19,421 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-10-26 00:36:19,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:36:19,421 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1049502960, now seen corresponding path program 4 times [2020-10-26 00:36:19,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:19,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995238458] [2020-10-26 00:36:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:20,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995238458] [2020-10-26 00:36:20,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:20,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-26 00:36:20,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038345045] [2020-10-26 00:36:20,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 00:36:20,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 00:36:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:20,118 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 11 states. [2020-10-26 00:36:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:20,959 INFO L93 Difference]: Finished difference Result 190 states and 307 transitions. [2020-10-26 00:36:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-26 00:36:20,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-26 00:36:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:20,962 INFO L225 Difference]: With dead ends: 190 [2020-10-26 00:36:20,962 INFO L226 Difference]: Without dead ends: 174 [2020-10-26 00:36:20,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-26 00:36:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2020-10-26 00:36:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-26 00:36:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 219 transitions. [2020-10-26 00:36:20,968 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 219 transitions. Word has length 22 [2020-10-26 00:36:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:20,968 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 219 transitions. [2020-10-26 00:36:20,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 00:36:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 219 transitions. [2020-10-26 00:36:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:20,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:20,969 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-10-26 00:36:20,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:36:20,969 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1225918624, now seen corresponding path program 5 times [2020-10-26 00:36:20,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:20,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451527028] [2020-10-26 00:36:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:21,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451527028] [2020-10-26 00:36:21,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:21,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-26 00:36:21,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411773308] [2020-10-26 00:36:21,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 00:36:21,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 00:36:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:21,667 INFO L87 Difference]: Start difference. First operand 133 states and 219 transitions. Second operand 11 states. [2020-10-26 00:36:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:22,459 INFO L93 Difference]: Finished difference Result 183 states and 296 transitions. [2020-10-26 00:36:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 00:36:22,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-26 00:36:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:22,462 INFO L225 Difference]: With dead ends: 183 [2020-10-26 00:36:22,462 INFO L226 Difference]: Without dead ends: 163 [2020-10-26 00:36:22,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-26 00:36:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-26 00:36:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2020-10-26 00:36:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-26 00:36:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 249 transitions. [2020-10-26 00:36:22,468 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 249 transitions. Word has length 22 [2020-10-26 00:36:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:22,468 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 249 transitions. [2020-10-26 00:36:22,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 00:36:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 249 transitions. [2020-10-26 00:36:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:22,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:22,469 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-10-26 00:36:22,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 00:36:22,469 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1794260320, now seen corresponding path program 3 times [2020-10-26 00:36:22,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:22,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644755619] [2020-10-26 00:36:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:22,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644755619] [2020-10-26 00:36:22,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:22,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:22,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624433279] [2020-10-26 00:36:22,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:22,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:22,769 INFO L87 Difference]: Start difference. First operand 153 states and 249 transitions. Second operand 8 states. [2020-10-26 00:36:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:23,108 INFO L93 Difference]: Finished difference Result 203 states and 309 transitions. [2020-10-26 00:36:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:36:23,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:23,111 INFO L225 Difference]: With dead ends: 203 [2020-10-26 00:36:23,111 INFO L226 Difference]: Without dead ends: 179 [2020-10-26 00:36:23,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-26 00:36:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2020-10-26 00:36:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-26 00:36:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 183 transitions. [2020-10-26 00:36:23,115 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 183 transitions. Word has length 22 [2020-10-26 00:36:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:23,115 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 183 transitions. [2020-10-26 00:36:23,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 183 transitions. [2020-10-26 00:36:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:23,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:23,116 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-10-26 00:36:23,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 00:36:23,117 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1157540390, now seen corresponding path program 6 times [2020-10-26 00:36:23,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:23,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825729858] [2020-10-26 00:36:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:23,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825729858] [2020-10-26 00:36:23,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:23,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-26 00:36:23,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698021575] [2020-10-26 00:36:23,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 00:36:23,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 00:36:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:23,767 INFO L87 Difference]: Start difference. First operand 113 states and 183 transitions. Second operand 11 states. [2020-10-26 00:36:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:24,454 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2020-10-26 00:36:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 00:36:24,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-26 00:36:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:24,456 INFO L225 Difference]: With dead ends: 140 [2020-10-26 00:36:24,456 INFO L226 Difference]: Without dead ends: 101 [2020-10-26 00:36:24,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-26 00:36:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-26 00:36:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-26 00:36:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-26 00:36:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-10-26 00:36:24,460 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 22 [2020-10-26 00:36:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:24,461 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-26 00:36:24,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 00:36:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2020-10-26 00:36:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:24,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:24,461 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-10-26 00:36:24,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 00:36:24,462 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:24,462 INFO L82 PathProgramCache]: Analyzing trace with hash 698584272, now seen corresponding path program 7 times [2020-10-26 00:36:24,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:24,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749138636] [2020-10-26 00:36:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:25,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749138636] [2020-10-26 00:36:25,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:25,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:25,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219023620] [2020-10-26 00:36:25,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:25,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:25,324 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand 12 states. [2020-10-26 00:36:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:26,099 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2020-10-26 00:36:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:26,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:26,101 INFO L225 Difference]: With dead ends: 129 [2020-10-26 00:36:26,101 INFO L226 Difference]: Without dead ends: 101 [2020-10-26 00:36:26,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-26 00:36:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-26 00:36:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-26 00:36:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2020-10-26 00:36:26,109 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 162 transitions. Word has length 22 [2020-10-26 00:36:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:26,109 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-26 00:36:26,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 162 transitions. [2020-10-26 00:36:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:26,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:26,111 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-10-26 00:36:26,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-26 00:36:26,112 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash -882544438, now seen corresponding path program 8 times [2020-10-26 00:36:26,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:26,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125541678] [2020-10-26 00:36:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:26,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125541678] [2020-10-26 00:36:26,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:26,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:26,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232099529] [2020-10-26 00:36:26,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:26,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:26,920 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. Second operand 12 states. [2020-10-26 00:36:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:27,788 INFO L93 Difference]: Finished difference Result 120 states and 186 transitions. [2020-10-26 00:36:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 00:36:27,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:27,796 INFO L225 Difference]: With dead ends: 120 [2020-10-26 00:36:27,796 INFO L226 Difference]: Without dead ends: 106 [2020-10-26 00:36:27,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-26 00:36:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2020-10-26 00:36:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-26 00:36:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 154 transitions. [2020-10-26 00:36:27,800 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 154 transitions. Word has length 22 [2020-10-26 00:36:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:27,801 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 154 transitions. [2020-10-26 00:36:27,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 154 transitions. [2020-10-26 00:36:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:27,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:27,801 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-10-26 00:36:27,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-26 00:36:27,802 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1084936394, now seen corresponding path program 9 times [2020-10-26 00:36:27,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:27,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592800518] [2020-10-26 00:36:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:28,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592800518] [2020-10-26 00:36:28,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:28,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:28,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954014561] [2020-10-26 00:36:28,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:28,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:28,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:28,713 INFO L87 Difference]: Start difference. First operand 97 states and 154 transitions. Second operand 12 states. [2020-10-26 00:36:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:29,671 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2020-10-26 00:36:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 00:36:29,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:29,673 INFO L225 Difference]: With dead ends: 120 [2020-10-26 00:36:29,673 INFO L226 Difference]: Without dead ends: 104 [2020-10-26 00:36:29,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-26 00:36:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2020-10-26 00:36:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-26 00:36:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2020-10-26 00:36:29,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 22 [2020-10-26 00:36:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:29,679 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2020-10-26 00:36:29,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2020-10-26 00:36:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:29,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:29,682 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-10-26 00:36:29,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-26 00:36:29,683 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1190485190, now seen corresponding path program 10 times [2020-10-26 00:36:29,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:29,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289483673] [2020-10-26 00:36:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:30,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289483673] [2020-10-26 00:36:30,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:30,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:30,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821128342] [2020-10-26 00:36:30,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:30,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:30,547 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand 12 states. [2020-10-26 00:36:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:31,460 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2020-10-26 00:36:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:31,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:31,462 INFO L225 Difference]: With dead ends: 117 [2020-10-26 00:36:31,463 INFO L226 Difference]: Without dead ends: 91 [2020-10-26 00:36:31,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-26 00:36:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-26 00:36:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-26 00:36:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2020-10-26 00:36:31,466 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 22 [2020-10-26 00:36:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:31,467 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2020-10-26 00:36:31,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2020-10-26 00:36:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:31,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:31,467 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-10-26 00:36:31,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-26 00:36:31,468 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:31,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1122106956, now seen corresponding path program 11 times [2020-10-26 00:36:31,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:31,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532522374] [2020-10-26 00:36:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:32,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532522374] [2020-10-26 00:36:32,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:32,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:32,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377091003] [2020-10-26 00:36:32,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:32,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:32,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:32,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:32,264 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand 12 states. [2020-10-26 00:36:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:33,075 INFO L93 Difference]: Finished difference Result 118 states and 183 transitions. [2020-10-26 00:36:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:33,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:33,076 INFO L225 Difference]: With dead ends: 118 [2020-10-26 00:36:33,077 INFO L226 Difference]: Without dead ends: 82 [2020-10-26 00:36:33,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-26 00:36:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-26 00:36:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-26 00:36:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2020-10-26 00:36:33,079 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 22 [2020-10-26 00:36:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:33,080 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2020-10-26 00:36:33,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2020-10-26 00:36:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:33,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:33,083 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-10-26 00:36:33,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-26 00:36:33,083 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash 131238104, now seen corresponding path program 12 times [2020-10-26 00:36:33,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:33,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493089262] [2020-10-26 00:36:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:34,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493089262] [2020-10-26 00:36:34,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:34,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:34,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732537633] [2020-10-26 00:36:34,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:34,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:34,061 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand 12 states. [2020-10-26 00:36:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:34,946 INFO L93 Difference]: Finished difference Result 112 states and 169 transitions. [2020-10-26 00:36:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:34,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:34,948 INFO L225 Difference]: With dead ends: 112 [2020-10-26 00:36:34,948 INFO L226 Difference]: Without dead ends: 74 [2020-10-26 00:36:34,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-10-26 00:36:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-26 00:36:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-26 00:36:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-26 00:36:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2020-10-26 00:36:34,951 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 22 [2020-10-26 00:36:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:34,951 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2020-10-26 00:36:34,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2020-10-26 00:36:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:34,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:34,952 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-10-26 00:36:34,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-26 00:36:34,952 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash 566019722, now seen corresponding path program 13 times [2020-10-26 00:36:34,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:34,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564568165] [2020-10-26 00:36:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:35,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564568165] [2020-10-26 00:36:35,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:35,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:35,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748205895] [2020-10-26 00:36:35,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:35,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:35,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:35,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:35,731 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 12 states. [2020-10-26 00:36:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:36,573 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2020-10-26 00:36:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 00:36:36,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:36,575 INFO L225 Difference]: With dead ends: 83 [2020-10-26 00:36:36,575 INFO L226 Difference]: Without dead ends: 83 [2020-10-26 00:36:36,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-26 00:36:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2020-10-26 00:36:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-26 00:36:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-10-26 00:36:36,580 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 22 [2020-10-26 00:36:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:36,580 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-10-26 00:36:36,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-10-26 00:36:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:36,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:36,581 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-10-26 00:36:36,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-26 00:36:36,581 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash 566019706, now seen corresponding path program 4 times [2020-10-26 00:36:36,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:36,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624467732] [2020-10-26 00:36:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:36,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624467732] [2020-10-26 00:36:36,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:36,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:36,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079602756] [2020-10-26 00:36:36,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:36,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:36,917 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand 8 states. [2020-10-26 00:36:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:37,188 INFO L93 Difference]: Finished difference Result 92 states and 125 transitions. [2020-10-26 00:36:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:36:37,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:37,190 INFO L225 Difference]: With dead ends: 92 [2020-10-26 00:36:37,190 INFO L226 Difference]: Without dead ends: 84 [2020-10-26 00:36:37,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-26 00:36:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-26 00:36:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2020-10-26 00:36:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-26 00:36:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2020-10-26 00:36:37,193 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 22 [2020-10-26 00:36:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:37,193 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2020-10-26 00:36:37,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2020-10-26 00:36:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:37,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:37,195 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-10-26 00:36:37,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-26 00:36:37,195 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:37,196 INFO L82 PathProgramCache]: Analyzing trace with hash -616705242, now seen corresponding path program 14 times [2020-10-26 00:36:37,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:37,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229790946] [2020-10-26 00:36:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:37,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229790946] [2020-10-26 00:36:37,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:37,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:37,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68414178] [2020-10-26 00:36:37,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:37,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:37,884 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand 12 states. [2020-10-26 00:36:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:38,633 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2020-10-26 00:36:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:38,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:38,635 INFO L225 Difference]: With dead ends: 86 [2020-10-26 00:36:38,635 INFO L226 Difference]: Without dead ends: 73 [2020-10-26 00:36:38,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-26 00:36:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-10-26 00:36:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-26 00:36:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2020-10-26 00:36:38,639 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 22 [2020-10-26 00:36:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:38,640 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2020-10-26 00:36:38,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2020-10-26 00:36:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:38,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:38,640 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-10-26 00:36:38,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-26 00:36:38,641 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1517132414, now seen corresponding path program 15 times [2020-10-26 00:36:38,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:38,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482625357] [2020-10-26 00:36:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:39,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482625357] [2020-10-26 00:36:39,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:39,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:39,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942076314] [2020-10-26 00:36:39,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:39,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:39,330 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand 12 states. [2020-10-26 00:36:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:40,168 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2020-10-26 00:36:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 00:36:40,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:40,170 INFO L225 Difference]: With dead ends: 88 [2020-10-26 00:36:40,171 INFO L226 Difference]: Without dead ends: 77 [2020-10-26 00:36:40,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-26 00:36:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-10-26 00:36:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-26 00:36:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2020-10-26 00:36:40,175 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 22 [2020-10-26 00:36:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:40,175 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2020-10-26 00:36:40,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2020-10-26 00:36:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:40,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:40,176 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-10-26 00:36:40,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-26 00:36:40,176 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1024190236, now seen corresponding path program 5 times [2020-10-26 00:36:40,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:40,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862443219] [2020-10-26 00:36:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:40,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862443219] [2020-10-26 00:36:40,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:40,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:40,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310703463] [2020-10-26 00:36:40,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:40,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:40,507 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand 8 states. [2020-10-26 00:36:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:40,801 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2020-10-26 00:36:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:36:40,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:40,803 INFO L225 Difference]: With dead ends: 76 [2020-10-26 00:36:40,803 INFO L226 Difference]: Without dead ends: 64 [2020-10-26 00:36:40,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-26 00:36:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-26 00:36:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-26 00:36:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-10-26 00:36:40,808 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 22 [2020-10-26 00:36:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:40,809 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-10-26 00:36:40,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-10-26 00:36:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:40,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:40,809 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-10-26 00:36:40,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-26 00:36:40,810 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -304507168, now seen corresponding path program 16 times [2020-10-26 00:36:40,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:40,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442932036] [2020-10-26 00:36:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:41,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442932036] [2020-10-26 00:36:41,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:41,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:41,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076901873] [2020-10-26 00:36:41,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:41,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:41,622 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand 12 states. [2020-10-26 00:36:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:42,468 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2020-10-26 00:36:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 00:36:42,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:42,470 INFO L225 Difference]: With dead ends: 77 [2020-10-26 00:36:42,470 INFO L226 Difference]: Without dead ends: 77 [2020-10-26 00:36:42,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-26 00:36:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-26 00:36:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-10-26 00:36:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-26 00:36:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2020-10-26 00:36:42,474 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 22 [2020-10-26 00:36:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:42,474 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2020-10-26 00:36:42,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-10-26 00:36:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:42,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:42,475 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-10-26 00:36:42,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-26 00:36:42,475 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -304507184, now seen corresponding path program 6 times [2020-10-26 00:36:42,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:42,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557178529] [2020-10-26 00:36:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:42,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557178529] [2020-10-26 00:36:42,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:42,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:36:42,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854658027] [2020-10-26 00:36:42,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:36:42,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:36:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:36:42,786 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 8 states. [2020-10-26 00:36:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:43,098 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2020-10-26 00:36:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:36:43,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-26 00:36:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:43,099 INFO L225 Difference]: With dead ends: 75 [2020-10-26 00:36:43,099 INFO L226 Difference]: Without dead ends: 59 [2020-10-26 00:36:43,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-26 00:36:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-10-26 00:36:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-26 00:36:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2020-10-26 00:36:43,102 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 22 [2020-10-26 00:36:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:43,103 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2020-10-26 00:36:43,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:36:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2020-10-26 00:36:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:43,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:43,103 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-10-26 00:36:43,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-26 00:36:43,104 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1003507688, now seen corresponding path program 17 times [2020-10-26 00:36:43,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:43,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554473798] [2020-10-26 00:36:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:43,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554473798] [2020-10-26 00:36:43,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:43,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:43,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647891837] [2020-10-26 00:36:43,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:43,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:43,846 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 12 states. [2020-10-26 00:36:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:44,602 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-10-26 00:36:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 00:36:44,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:44,608 INFO L225 Difference]: With dead ends: 66 [2020-10-26 00:36:44,608 INFO L226 Difference]: Without dead ends: 51 [2020-10-26 00:36:44,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-26 00:36:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-26 00:36:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-26 00:36:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2020-10-26 00:36:44,611 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 22 [2020-10-26 00:36:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:44,611 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2020-10-26 00:36:44,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2020-10-26 00:36:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:44,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:44,612 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-10-26 00:36:44,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-26 00:36:44,612 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 35529654, now seen corresponding path program 18 times [2020-10-26 00:36:44,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:44,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575464218] [2020-10-26 00:36:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:45,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575464218] [2020-10-26 00:36:45,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:45,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:45,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507475744] [2020-10-26 00:36:45,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:45,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:45,381 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 12 states. [2020-10-26 00:36:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:46,167 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2020-10-26 00:36:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:46,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:46,169 INFO L225 Difference]: With dead ends: 66 [2020-10-26 00:36:46,169 INFO L226 Difference]: Without dead ends: 47 [2020-10-26 00:36:46,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-26 00:36:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-26 00:36:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 00:36:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-26 00:36:46,173 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2020-10-26 00:36:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:46,173 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-26 00:36:46,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-26 00:36:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:46,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:46,173 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-10-26 00:36:46,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-26 00:36:46,174 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1172676456, now seen corresponding path program 19 times [2020-10-26 00:36:46,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:46,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718537686] [2020-10-26 00:36:46,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:46,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718537686] [2020-10-26 00:36:46,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:46,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:46,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628507577] [2020-10-26 00:36:46,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:46,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:46,951 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 12 states. [2020-10-26 00:36:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:47,619 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-26 00:36:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:47,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:47,620 INFO L225 Difference]: With dead ends: 53 [2020-10-26 00:36:47,620 INFO L226 Difference]: Without dead ends: 38 [2020-10-26 00:36:47,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-26 00:36:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-26 00:36:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-26 00:36:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2020-10-26 00:36:47,624 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2020-10-26 00:36:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:47,624 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2020-10-26 00:36:47,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2020-10-26 00:36:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-26 00:36:47,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:36:47,625 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-10-26 00:36:47,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-26 00:36:47,625 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:36:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:36:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 552705304, now seen corresponding path program 20 times [2020-10-26 00:36:47,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:36:47,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435100895] [2020-10-26 00:36:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:36:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:36:48,001 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-10-26 00:36:48,154 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2020-10-26 00:36:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:36:48,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435100895] [2020-10-26 00:36:48,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:36:48,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:36:48,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184220872] [2020-10-26 00:36:48,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:36:48,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:36:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:36:48,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:36:48,504 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 12 states. [2020-10-26 00:36:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:36:49,249 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-10-26 00:36:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 00:36:49,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-26 00:36:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:36:49,250 INFO L225 Difference]: With dead ends: 37 [2020-10-26 00:36:49,251 INFO L226 Difference]: Without dead ends: 0 [2020-10-26 00:36:49,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-26 00:36:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-26 00:36:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-26 00:36:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-26 00:36:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 00:36:49,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-26 00:36:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:36:49,253 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 00:36:49,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:36:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-26 00:36:49,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-26 00:36:49,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-26 00:36:49,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:36:49 BasicIcfg [2020-10-26 00:36:49,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:36:49,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:36:49,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:36:49,259 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:36:49,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:35:42" (3/4) ... [2020-10-26 00:36:49,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-26 00:36:49,272 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2020-10-26 00:36:49,280 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2020-10-26 00:36:49,280 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-26 00:36:49,281 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-26 00:36:49,281 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-26 00:36:49,332 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:36:49,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:36:49,335 INFO L168 Benchmark]: Toolchain (without parser) took 69771.61 ms. Allocated memory was 48.2 MB in the beginning and 251.7 MB in the end (delta: 203.4 MB). Free memory was 33.2 MB in the beginning and 90.5 MB in the end (delta: -57.3 MB). Peak memory consumption was 144.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,335 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 37.7 MB. Free memory was 20.6 MB in the beginning and 20.6 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:36:49,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1809.96 ms. Allocated memory was 48.2 MB in the beginning and 81.8 MB in the end (delta: 33.6 MB). Free memory was 32.5 MB in the beginning and 45.4 MB in the end (delta: -12.9 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.72 ms. Allocated memory is still 81.8 MB. Free memory was 45.4 MB in the beginning and 41.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,337 INFO L168 Benchmark]: Boogie Preprocessor took 54.23 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 39.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,337 INFO L168 Benchmark]: RCFGBuilder took 1006.86 ms. Allocated memory is still 81.8 MB. Free memory was 39.1 MB in the beginning and 40.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,338 INFO L168 Benchmark]: TraceAbstraction took 66692.20 ms. Allocated memory was 81.8 MB in the beginning and 251.7 MB in the end (delta: 169.9 MB). Free memory was 40.0 MB in the beginning and 94.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 114.8 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,338 INFO L168 Benchmark]: Witness Printer took 74.05 ms. Allocated memory is still 251.7 MB. Free memory was 94.7 MB in the beginning and 90.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:36:49,341 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.31 ms. Allocated memory is still 37.7 MB. Free memory was 20.6 MB in the beginning and 20.6 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1809.96 ms. Allocated memory was 48.2 MB in the beginning and 81.8 MB in the end (delta: 33.6 MB). Free memory was 32.5 MB in the beginning and 45.4 MB in the end (delta: -12.9 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.72 ms. Allocated memory is still 81.8 MB. Free memory was 45.4 MB in the beginning and 41.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.23 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 39.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1006.86 ms. Allocated memory is still 81.8 MB. Free memory was 39.1 MB in the beginning and 40.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 66692.20 ms. Allocated memory was 81.8 MB in the beginning and 251.7 MB in the end (delta: 169.9 MB). Free memory was 40.0 MB in the beginning and 94.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 114.8 MB. Max. memory is 16.1 GB. * Witness Printer took 74.05 ms. Allocated memory is still 251.7 MB. Free memory was 94.7 MB in the beginning and 90.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2212 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.8s, 173 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 29.0s, 178 PlacesBefore, 41 PlacesAfterwards, 188 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 9 FixpointIterations, 118 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 22 ConcurrentYvCompositions, 11 ChoiceCompositions, 229 TotalNumberOfCompositions, 8034 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 66.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 29.1s, HoareTripleCheckerStatistics: 673 SDtfs, 905 SDslu, 2200 SDs, 0 SdLazy, 5702 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 22 SyntacticMatches, 46 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 385 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 284673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 correct! Received shutdown request...