./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/lamport.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 22c1a7ba6cef8c4744a9014742d68072d39cb86a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 21:02:28,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 21:02:28,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 21:02:28,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 21:02:28,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 21:02:28,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 21:02:28,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 21:02:28,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 21:02:28,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 21:02:28,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 21:02:28,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 21:02:28,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 21:02:28,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 21:02:28,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 21:02:28,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 21:02:28,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 21:02:28,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 21:02:28,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 21:02:28,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 21:02:28,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 21:02:28,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 21:02:28,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 21:02:28,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 21:02:28,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 21:02:28,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 21:02:28,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 21:02:28,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 21:02:28,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 21:02:28,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 21:02:28,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 21:02:28,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 21:02:28,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 21:02:28,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 21:02:28,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 21:02:28,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 21:02:28,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 21:02:28,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 21:02:28,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 21:02:28,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 21:02:28,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 21:02:28,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 21:02:28,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 21:02:28,924 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 21:02:28,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 21:02:28,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 21:02:28,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 21:02:28,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 21:02:28,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 21:02:28,926 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 21:02:28,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 21:02:28,927 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 21:02:28,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 21:02:28,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 21:02:28,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 21:02:28,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 21:02:28,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 21:02:28,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 21:02:28,928 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 21:02:28,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 21:02:28,929 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 21:02:28,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 21:02:28,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 21:02:28,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 21:02:28,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 21:02:28,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:02:28,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 21:02:28,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 21:02:28,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 21:02:28,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 21:02:28,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 21:02:28,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 21:02:28,931 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 21:02:28,931 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-2/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-2/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 -> 22c1a7ba6cef8c4744a9014742d68072d39cb86a [2021-10-05 21:02:29,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 21:02:29,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 21:02:29,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 21:02:29,374 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 21:02:29,375 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 21:02:29,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-05 21:02:29,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3d4c7077a/a0aade152d034eb8a2b362094ec72c78/FLAGf51594633 [2021-10-05 21:02:30,025 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 21:02:30,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-05 21:02:30,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3d4c7077a/a0aade152d034eb8a2b362094ec72c78/FLAGf51594633 [2021-10-05 21:02:30,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3d4c7077a/a0aade152d034eb8a2b362094ec72c78 [2021-10-05 21:02:30,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 21:02:30,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 21:02:30,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 21:02:30,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 21:02:30,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 21:02:30,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746cc5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30, skipping insertion in model container [2021-10-05 21:02:30,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 21:02:30,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 21:02:30,590 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c[2722,2735] [2021-10-05 21:02:30,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:02:30,610 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 21:02:30,639 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c[2722,2735] [2021-10-05 21:02:30,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:02:30,666 INFO L208 MainTranslator]: Completed translation [2021-10-05 21:02:30,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30 WrapperNode [2021-10-05 21:02:30,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 21:02:30,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 21:02:30,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 21:02:30,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 21:02:30,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 21:02:30,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 21:02:30,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 21:02:30,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 21:02:30,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 21:02:30,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 21:02:30,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 21:02:30,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 21:02:30,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (1/1) ... [2021-10-05 21:02:30,850 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:02:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 21:02:30,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 21:02:30,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 21:02:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 21:02:30,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 21:02:30,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 21:02:30,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 21:02:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 21:02:30,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 21:02:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 21:02:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 21:02:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 21:02:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-05 21:02:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 21:02:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 21:02:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 21:02:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 21:02:30,983 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 21:02:31,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 21:02:31,458 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-10-05 21:02:31,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:31 BoogieIcfgContainer [2021-10-05 21:02:31,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 21:02:31,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 21:02:31,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 21:02:31,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 21:02:31,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 09:02:30" (1/3) ... [2021-10-05 21:02:31,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2b01f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:02:31, skipping insertion in model container [2021-10-05 21:02:31,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:30" (2/3) ... [2021-10-05 21:02:31,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2b01f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:02:31, skipping insertion in model container [2021-10-05 21:02:31,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:31" (3/3) ... [2021-10-05 21:02:31,471 INFO L111 eAbstractionObserver]: Analyzing ICFG lamport.wvr.c [2021-10-05 21:02:31,478 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 21:02:31,478 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 21:02:31,479 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 21:02:31,479 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 21:02:31,561 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,562 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,562 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,562 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,563 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,563 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,563 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,563 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,563 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,568 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,568 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,569 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,569 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,569 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,570 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,570 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,570 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,570 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,570 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,571 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,572 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,572 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,572 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,572 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,573 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,573 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,573 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,574 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,575 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,575 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,575 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,575 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,576 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,576 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,576 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,577 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,577 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,577 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,577 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,578 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,578 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,578 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,579 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,579 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,579 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,579 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,584 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,584 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,585 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,585 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,585 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,585 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,586 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,586 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,586 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,587 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,587 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,587 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,588 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,588 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,588 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,589 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,589 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,590 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,590 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,591 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,591 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,592 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,592 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,592 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,592 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,593 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,593 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,593 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,594 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,594 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,596 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,598 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,607 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,608 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,608 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,608 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,609 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,613 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,613 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,613 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,613 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,614 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,614 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,614 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,614 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,614 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,615 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,615 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,615 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,615 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,615 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,616 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,616 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,616 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,616 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,617 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,617 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,617 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,617 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,621 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,621 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,622 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,622 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,622 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,622 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,627 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,628 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,628 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,628 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,628 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,630 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,630 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,631 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,631 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,631 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:31,641 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 21:02:31,694 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 21:02:31,702 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 21:02:31,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 21:02:31,732 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 21:02:31,746 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 204 transitions, 432 flow [2021-10-05 21:02:31,750 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 204 transitions, 432 flow [2021-10-05 21:02:31,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 201 places, 204 transitions, 432 flow [2021-10-05 21:02:31,879 INFO L129 PetriNetUnfolder]: 13/201 cut-off events. [2021-10-05 21:02:31,879 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 21:02:31,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 201 events. 13/201 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2021-10-05 21:02:31,898 INFO L116 LiptonReduction]: Number of co-enabled transitions 5124 [2021-10-05 21:02:41,077 INFO L131 LiptonReduction]: Checked pairs total: 16438 [2021-10-05 21:02:41,078 INFO L133 LiptonReduction]: Total number of compositions: 206 [2021-10-05 21:02:41,089 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2021-10-05 21:02:41,182 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-05 21:02:41,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:41,224 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:41,225 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1829567922, now seen corresponding path program 1 times [2021-10-05 21:02:41,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:41,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569612676] [2021-10-05 21:02:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:41,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:41,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:41,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569612676] [2021-10-05 21:02:41,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569612676] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:41,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:41,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 21:02:41,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933476088] [2021-10-05 21:02:41,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 21:02:41,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 21:02:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:02:41,508 INFO L87 Difference]: Start difference. First operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:41,566 INFO L93 Difference]: Finished difference Result 945 states and 2622 transitions. [2021-10-05 21:02:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 21:02:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-05 21:02:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:41,608 INFO L225 Difference]: With dead ends: 945 [2021-10-05 21:02:41,609 INFO L226 Difference]: Without dead ends: 945 [2021-10-05 21:02:41,610 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:02:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-10-05 21:02:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-10-05 21:02:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.777542372881356) internal successors, (2622), 944 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2622 transitions. [2021-10-05 21:02:41,743 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2622 transitions. Word has length 19 [2021-10-05 21:02:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:41,744 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2622 transitions. [2021-10-05 21:02:41,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2622 transitions. [2021-10-05 21:02:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:41,753 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:41,753 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:41,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 21:02:41,754 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -518723085, now seen corresponding path program 1 times [2021-10-05 21:02:41,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:41,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846933088] [2021-10-05 21:02:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:41,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:42,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:42,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846933088] [2021-10-05 21:02:42,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846933088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:42,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:42,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:42,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667156136] [2021-10-05 21:02:42,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:42,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:42,368 INFO L87 Difference]: Start difference. First operand 945 states and 2622 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:42,950 INFO L93 Difference]: Finished difference Result 1200 states and 3198 transitions. [2021-10-05 21:02:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:02:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:42,963 INFO L225 Difference]: With dead ends: 1200 [2021-10-05 21:02:42,963 INFO L226 Difference]: Without dead ends: 1101 [2021-10-05 21:02:42,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 251.7ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:02:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2021-10-05 21:02:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 945. [2021-10-05 21:02:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.718220338983051) internal successors, (2566), 944 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2566 transitions. [2021-10-05 21:02:43,007 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2566 transitions. Word has length 37 [2021-10-05 21:02:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:43,008 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2566 transitions. [2021-10-05 21:02:43,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2566 transitions. [2021-10-05 21:02:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:43,012 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:43,012 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:43,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 21:02:43,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1968724417, now seen corresponding path program 2 times [2021-10-05 21:02:43,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:43,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31546611] [2021-10-05 21:02:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:43,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:43,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:43,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31546611] [2021-10-05 21:02:43,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31546611] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:43,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:43,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:43,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422233430] [2021-10-05 21:02:43,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:43,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:43,361 INFO L87 Difference]: Start difference. First operand 945 states and 2566 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:43,865 INFO L93 Difference]: Finished difference Result 1156 states and 3103 transitions. [2021-10-05 21:02:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:02:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:43,875 INFO L225 Difference]: With dead ends: 1156 [2021-10-05 21:02:43,875 INFO L226 Difference]: Without dead ends: 1085 [2021-10-05 21:02:43,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 238.0ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:02:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-10-05 21:02:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 973. [2021-10-05 21:02:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 2.7098765432098766) internal successors, (2634), 972 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2634 transitions. [2021-10-05 21:02:43,911 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2634 transitions. Word has length 37 [2021-10-05 21:02:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:43,912 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 2634 transitions. [2021-10-05 21:02:43,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2634 transitions. [2021-10-05 21:02:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:43,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:43,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:43,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 21:02:43,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1498182851, now seen corresponding path program 3 times [2021-10-05 21:02:43,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:43,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142577789] [2021-10-05 21:02:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:43,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:44,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:44,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142577789] [2021-10-05 21:02:44,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142577789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:44,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:44,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:02:44,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055557536] [2021-10-05 21:02:44,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-05 21:02:44,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-05 21:02:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:02:44,293 INFO L87 Difference]: Start difference. First operand 973 states and 2634 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:44,931 INFO L93 Difference]: Finished difference Result 1120 states and 2993 transitions. [2021-10-05 21:02:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:02:44,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:44,939 INFO L225 Difference]: With dead ends: 1120 [2021-10-05 21:02:44,939 INFO L226 Difference]: Without dead ends: 1071 [2021-10-05 21:02:44,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 336.5ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:02:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-10-05 21:02:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 959. [2021-10-05 21:02:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 2.7066805845511483) internal successors, (2593), 958 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2593 transitions. [2021-10-05 21:02:44,969 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2593 transitions. Word has length 37 [2021-10-05 21:02:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:44,970 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 2593 transitions. [2021-10-05 21:02:44,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2593 transitions. [2021-10-05 21:02:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:44,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:44,974 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:44,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 21:02:44,974 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1443845345, now seen corresponding path program 4 times [2021-10-05 21:02:44,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:44,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061486346] [2021-10-05 21:02:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:44,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:45,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:45,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061486346] [2021-10-05 21:02:45,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061486346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:45,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:45,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:45,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598826137] [2021-10-05 21:02:45,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:45,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:45,207 INFO L87 Difference]: Start difference. First operand 959 states and 2593 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:45,731 INFO L93 Difference]: Finished difference Result 1114 states and 2969 transitions. [2021-10-05 21:02:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:02:45,732 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:45,741 INFO L225 Difference]: With dead ends: 1114 [2021-10-05 21:02:45,742 INFO L226 Difference]: Without dead ends: 953 [2021-10-05 21:02:45,742 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 247.8ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:02:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-10-05 21:02:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 841. [2021-10-05 21:02:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 2.732142857142857) internal successors, (2295), 840 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2295 transitions. [2021-10-05 21:02:45,779 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2295 transitions. Word has length 37 [2021-10-05 21:02:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:45,781 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 2295 transitions. [2021-10-05 21:02:45,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2295 transitions. [2021-10-05 21:02:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:45,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:45,785 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:45,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 21:02:45,786 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1774997531, now seen corresponding path program 5 times [2021-10-05 21:02:45,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:45,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152124114] [2021-10-05 21:02:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:45,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:45,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:45,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152124114] [2021-10-05 21:02:45,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152124114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:45,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:45,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:45,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368264255] [2021-10-05 21:02:45,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:45,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:45,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:45,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:45,950 INFO L87 Difference]: Start difference. First operand 841 states and 2295 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:46,085 INFO L93 Difference]: Finished difference Result 1571 states and 4248 transitions. [2021-10-05 21:02:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:02:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:46,096 INFO L225 Difference]: With dead ends: 1571 [2021-10-05 21:02:46,096 INFO L226 Difference]: Without dead ends: 1527 [2021-10-05 21:02:46,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:02:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-10-05 21:02:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1001. [2021-10-05 21:02:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 2.711) internal successors, (2711), 1000 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2711 transitions. [2021-10-05 21:02:46,134 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2711 transitions. Word has length 37 [2021-10-05 21:02:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:46,135 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 2711 transitions. [2021-10-05 21:02:46,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2711 transitions. [2021-10-05 21:02:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:46,139 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:46,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:46,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 21:02:46,139 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:46,140 INFO L82 PathProgramCache]: Analyzing trace with hash 385123147, now seen corresponding path program 6 times [2021-10-05 21:02:46,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:46,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455315456] [2021-10-05 21:02:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:46,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:46,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:46,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455315456] [2021-10-05 21:02:46,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455315456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:46,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:46,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:02:46,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92722228] [2021-10-05 21:02:46,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:02:46,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:02:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:02:46,382 INFO L87 Difference]: Start difference. First operand 1001 states and 2711 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:46,844 INFO L93 Difference]: Finished difference Result 1260 states and 3286 transitions. [2021-10-05 21:02:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:02:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:46,859 INFO L225 Difference]: With dead ends: 1260 [2021-10-05 21:02:46,860 INFO L226 Difference]: Without dead ends: 1107 [2021-10-05 21:02:46,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 256.7ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:02:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-10-05 21:02:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 985. [2021-10-05 21:02:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 2.6910569105691056) internal successors, (2648), 984 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2648 transitions. [2021-10-05 21:02:46,903 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2648 transitions. Word has length 37 [2021-10-05 21:02:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:46,904 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 2648 transitions. [2021-10-05 21:02:46,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2648 transitions. [2021-10-05 21:02:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:46,909 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:46,909 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:46,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 21:02:46,909 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:46,910 INFO L82 PathProgramCache]: Analyzing trace with hash -471075629, now seen corresponding path program 7 times [2021-10-05 21:02:46,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:46,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991107769] [2021-10-05 21:02:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:46,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:47,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:47,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991107769] [2021-10-05 21:02:47,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991107769] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:47,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:47,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:47,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549645320] [2021-10-05 21:02:47,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:47,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:47,104 INFO L87 Difference]: Start difference. First operand 985 states and 2648 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:47,393 INFO L93 Difference]: Finished difference Result 1330 states and 3403 transitions. [2021-10-05 21:02:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:02:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:47,412 INFO L225 Difference]: With dead ends: 1330 [2021-10-05 21:02:47,413 INFO L226 Difference]: Without dead ends: 1165 [2021-10-05 21:02:47,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 98.0ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:02:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-10-05 21:02:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 969. [2021-10-05 21:02:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 2.6807851239669422) internal successors, (2595), 968 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2595 transitions. [2021-10-05 21:02:47,447 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2595 transitions. Word has length 37 [2021-10-05 21:02:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:47,448 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 2595 transitions. [2021-10-05 21:02:47,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2595 transitions. [2021-10-05 21:02:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:47,451 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:47,452 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:47,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 21:02:47,452 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2087158397, now seen corresponding path program 8 times [2021-10-05 21:02:47,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:47,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500499819] [2021-10-05 21:02:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:47,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:47,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:47,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500499819] [2021-10-05 21:02:47,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500499819] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:47,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:47,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:47,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600878696] [2021-10-05 21:02:47,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:47,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:47,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:47,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:47,574 INFO L87 Difference]: Start difference. First operand 969 states and 2595 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:47,878 INFO L93 Difference]: Finished difference Result 1104 states and 2849 transitions. [2021-10-05 21:02:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:02:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:47,885 INFO L225 Difference]: With dead ends: 1104 [2021-10-05 21:02:47,885 INFO L226 Difference]: Without dead ends: 813 [2021-10-05 21:02:47,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 115.9ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:02:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-10-05 21:02:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 701. [2021-10-05 21:02:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.7457142857142856) internal successors, (1922), 700 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1922 transitions. [2021-10-05 21:02:47,908 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1922 transitions. Word has length 37 [2021-10-05 21:02:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:47,908 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1922 transitions. [2021-10-05 21:02:47,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1922 transitions. [2021-10-05 21:02:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:47,911 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:47,911 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:47,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 21:02:47,911 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash 300715621, now seen corresponding path program 9 times [2021-10-05 21:02:47,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:47,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122806583] [2021-10-05 21:02:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:47,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:47,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:47,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122806583] [2021-10-05 21:02:47,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122806583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:47,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:47,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 21:02:47,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026641338] [2021-10-05 21:02:47,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 21:02:47,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 21:02:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-05 21:02:47,957 INFO L87 Difference]: Start difference. First operand 701 states and 1922 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:47,981 INFO L93 Difference]: Finished difference Result 749 states and 2012 transitions. [2021-10-05 21:02:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 21:02:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:47,986 INFO L225 Difference]: With dead ends: 749 [2021-10-05 21:02:47,987 INFO L226 Difference]: Without dead ends: 701 [2021-10-05 21:02:47,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-05 21:02:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-10-05 21:02:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2021-10-05 21:02:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.72) internal successors, (1904), 700 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1904 transitions. [2021-10-05 21:02:48,008 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1904 transitions. Word has length 37 [2021-10-05 21:02:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:48,008 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1904 transitions. [2021-10-05 21:02:48,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1904 transitions. [2021-10-05 21:02:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:48,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:48,011 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:48,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 21:02:48,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 635562123, now seen corresponding path program 10 times [2021-10-05 21:02:48,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:48,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542012208] [2021-10-05 21:02:48,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:48,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:48,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:48,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542012208] [2021-10-05 21:02:48,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542012208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:48,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:48,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:48,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509727719] [2021-10-05 21:02:48,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:48,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:48,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:48,111 INFO L87 Difference]: Start difference. First operand 701 states and 1904 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:48,226 INFO L93 Difference]: Finished difference Result 1313 states and 3502 transitions. [2021-10-05 21:02:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:02:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:48,235 INFO L225 Difference]: With dead ends: 1313 [2021-10-05 21:02:48,235 INFO L226 Difference]: Without dead ends: 1169 [2021-10-05 21:02:48,235 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:02:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-10-05 21:02:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 707. [2021-10-05 21:02:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 2.7138810198300285) internal successors, (1916), 706 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1916 transitions. [2021-10-05 21:02:48,262 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1916 transitions. Word has length 37 [2021-10-05 21:02:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:48,262 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 1916 transitions. [2021-10-05 21:02:48,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1916 transitions. [2021-10-05 21:02:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:48,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:48,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:48,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 21:02:48,265 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1090437495, now seen corresponding path program 11 times [2021-10-05 21:02:48,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:48,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434701363] [2021-10-05 21:02:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:48,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:48,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:48,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434701363] [2021-10-05 21:02:48,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434701363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:48,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:48,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:48,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208234917] [2021-10-05 21:02:48,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:48,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:48,357 INFO L87 Difference]: Start difference. First operand 707 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:48,478 INFO L93 Difference]: Finished difference Result 887 states and 2384 transitions. [2021-10-05 21:02:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 21:02:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:48,484 INFO L225 Difference]: With dead ends: 887 [2021-10-05 21:02:48,484 INFO L226 Difference]: Without dead ends: 699 [2021-10-05 21:02:48,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:02:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-05 21:02:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 687. [2021-10-05 21:02:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 2.717201166180758) internal successors, (1864), 686 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1864 transitions. [2021-10-05 21:02:48,506 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1864 transitions. Word has length 37 [2021-10-05 21:02:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:48,506 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1864 transitions. [2021-10-05 21:02:48,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1864 transitions. [2021-10-05 21:02:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:48,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:48,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:48,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 21:02:48,510 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash 795454409, now seen corresponding path program 12 times [2021-10-05 21:02:48,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:48,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371352794] [2021-10-05 21:02:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:48,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:48,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:48,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371352794] [2021-10-05 21:02:48,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371352794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:48,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:48,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:48,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010088025] [2021-10-05 21:02:48,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:48,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:48,582 INFO L87 Difference]: Start difference. First operand 687 states and 1864 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:48,686 INFO L93 Difference]: Finished difference Result 861 states and 2314 transitions. [2021-10-05 21:02:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:02:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:48,692 INFO L225 Difference]: With dead ends: 861 [2021-10-05 21:02:48,693 INFO L226 Difference]: Without dead ends: 807 [2021-10-05 21:02:48,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:02:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-05 21:02:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-10-05 21:02:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.684863523573201) internal successors, (2164), 806 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2164 transitions. [2021-10-05 21:02:48,727 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2164 transitions. Word has length 37 [2021-10-05 21:02:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:48,728 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2164 transitions. [2021-10-05 21:02:48,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2164 transitions. [2021-10-05 21:02:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:48,731 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:48,731 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:48,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 21:02:48,732 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1506945655, now seen corresponding path program 13 times [2021-10-05 21:02:48,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:48,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261607521] [2021-10-05 21:02:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:48,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:48,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:48,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261607521] [2021-10-05 21:02:48,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261607521] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:48,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:48,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:48,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580316871] [2021-10-05 21:02:48,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:48,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:48,906 INFO L87 Difference]: Start difference. First operand 807 states and 2164 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:49,250 INFO L93 Difference]: Finished difference Result 1024 states and 2603 transitions. [2021-10-05 21:02:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:02:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:49,257 INFO L225 Difference]: With dead ends: 1024 [2021-10-05 21:02:49,257 INFO L226 Difference]: Without dead ends: 863 [2021-10-05 21:02:49,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:02:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-10-05 21:02:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 771. [2021-10-05 21:02:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 2.6363636363636362) internal successors, (2030), 770 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2030 transitions. [2021-10-05 21:02:49,281 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2030 transitions. Word has length 37 [2021-10-05 21:02:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:49,282 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 2030 transitions. [2021-10-05 21:02:49,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2030 transitions. [2021-10-05 21:02:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:49,284 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:49,285 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:49,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 21:02:49,285 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:49,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:49,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1361827723, now seen corresponding path program 14 times [2021-10-05 21:02:49,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:49,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131485273] [2021-10-05 21:02:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:49,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:49,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:49,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131485273] [2021-10-05 21:02:49,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131485273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:49,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:49,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:49,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218491116] [2021-10-05 21:02:49,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:49,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:49,405 INFO L87 Difference]: Start difference. First operand 771 states and 2030 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:49,769 INFO L93 Difference]: Finished difference Result 1104 states and 2908 transitions. [2021-10-05 21:02:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:02:49,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:49,778 INFO L225 Difference]: With dead ends: 1104 [2021-10-05 21:02:49,778 INFO L226 Difference]: Without dead ends: 1065 [2021-10-05 21:02:49,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 139.1ms TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:02:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-10-05 21:02:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 882. [2021-10-05 21:02:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 2.6799091940976165) internal successors, (2361), 881 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2361 transitions. [2021-10-05 21:02:49,813 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 2361 transitions. Word has length 37 [2021-10-05 21:02:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:49,813 INFO L470 AbstractCegarLoop]: Abstraction has 882 states and 2361 transitions. [2021-10-05 21:02:49,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 2361 transitions. [2021-10-05 21:02:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:49,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:49,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:49,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 21:02:49,817 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash -148850481, now seen corresponding path program 15 times [2021-10-05 21:02:49,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:49,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441345125] [2021-10-05 21:02:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:49,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:49,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:49,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441345125] [2021-10-05 21:02:49,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441345125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:49,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:49,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:49,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053973287] [2021-10-05 21:02:49,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:49,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:49,938 INFO L87 Difference]: Start difference. First operand 882 states and 2361 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:50,295 INFO L93 Difference]: Finished difference Result 1064 states and 2829 transitions. [2021-10-05 21:02:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:02:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:50,303 INFO L225 Difference]: With dead ends: 1064 [2021-10-05 21:02:50,303 INFO L226 Difference]: Without dead ends: 1031 [2021-10-05 21:02:50,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 142.1ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:02:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-10-05 21:02:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 891. [2021-10-05 21:02:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 2.6764044943820227) internal successors, (2382), 890 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2382 transitions. [2021-10-05 21:02:50,349 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2382 transitions. Word has length 37 [2021-10-05 21:02:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:50,349 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 2382 transitions. [2021-10-05 21:02:50,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2382 transitions. [2021-10-05 21:02:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:50,354 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:50,354 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:50,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 21:02:50,354 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1344275613, now seen corresponding path program 16 times [2021-10-05 21:02:50,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:50,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136150024] [2021-10-05 21:02:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:50,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:50,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:50,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136150024] [2021-10-05 21:02:50,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136150024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:50,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:50,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:50,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890101576] [2021-10-05 21:02:50,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:50,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:50,499 INFO L87 Difference]: Start difference. First operand 891 states and 2382 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:50,861 INFO L93 Difference]: Finished difference Result 1058 states and 2810 transitions. [2021-10-05 21:02:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:02:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:50,869 INFO L225 Difference]: With dead ends: 1058 [2021-10-05 21:02:50,869 INFO L226 Difference]: Without dead ends: 978 [2021-10-05 21:02:50,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 150.0ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:02:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-05 21:02:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 873. [2021-10-05 21:02:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 2.6731651376146788) internal successors, (2331), 872 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2331 transitions. [2021-10-05 21:02:50,896 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2331 transitions. Word has length 37 [2021-10-05 21:02:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:50,896 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 2331 transitions. [2021-10-05 21:02:50,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2331 transitions. [2021-10-05 21:02:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:50,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:50,899 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:50,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 21:02:50,900 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1309457275, now seen corresponding path program 17 times [2021-10-05 21:02:50,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:50,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351276265] [2021-10-05 21:02:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:50,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:51,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:51,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351276265] [2021-10-05 21:02:51,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351276265] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:51,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:51,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:51,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545462947] [2021-10-05 21:02:51,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:51,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:51,006 INFO L87 Difference]: Start difference. First operand 873 states and 2331 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:51,332 INFO L93 Difference]: Finished difference Result 1092 states and 2836 transitions. [2021-10-05 21:02:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:02:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:51,340 INFO L225 Difference]: With dead ends: 1092 [2021-10-05 21:02:51,340 INFO L226 Difference]: Without dead ends: 928 [2021-10-05 21:02:51,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 108.1ms TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:02:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-10-05 21:02:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 798. [2021-10-05 21:02:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.6223337515683816) internal successors, (2090), 797 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2090 transitions. [2021-10-05 21:02:51,390 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2090 transitions. Word has length 37 [2021-10-05 21:02:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:51,390 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 2090 transitions. [2021-10-05 21:02:51,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2090 transitions. [2021-10-05 21:02:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:51,393 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:51,394 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:51,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 21:02:51,394 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 79456157, now seen corresponding path program 18 times [2021-10-05 21:02:51,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:51,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663819557] [2021-10-05 21:02:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:51,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:51,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:51,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663819557] [2021-10-05 21:02:51,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663819557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:51,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:51,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:51,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893498206] [2021-10-05 21:02:51,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:51,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:51,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:51,529 INFO L87 Difference]: Start difference. First operand 798 states and 2090 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:51,856 INFO L93 Difference]: Finished difference Result 1003 states and 2545 transitions. [2021-10-05 21:02:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:02:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:51,860 INFO L225 Difference]: With dead ends: 1003 [2021-10-05 21:02:51,860 INFO L226 Difference]: Without dead ends: 884 [2021-10-05 21:02:51,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 124.6ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:02:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-05 21:02:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 780. [2021-10-05 21:02:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 2.6097560975609757) internal successors, (2033), 779 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2033 transitions. [2021-10-05 21:02:51,884 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2033 transitions. Word has length 37 [2021-10-05 21:02:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:51,884 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 2033 transitions. [2021-10-05 21:02:51,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2033 transitions. [2021-10-05 21:02:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:51,887 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:51,887 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:51,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 21:02:51,887 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1462467201, now seen corresponding path program 19 times [2021-10-05 21:02:51,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:51,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179440196] [2021-10-05 21:02:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:51,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:52,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:52,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179440196] [2021-10-05 21:02:52,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179440196] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:52,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:52,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862087935] [2021-10-05 21:02:52,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:02:52,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:02:52,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:02:52,015 INFO L87 Difference]: Start difference. First operand 780 states and 2033 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:52,360 INFO L93 Difference]: Finished difference Result 1017 states and 2508 transitions. [2021-10-05 21:02:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:02:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:52,363 INFO L225 Difference]: With dead ends: 1017 [2021-10-05 21:02:52,363 INFO L226 Difference]: Without dead ends: 814 [2021-10-05 21:02:52,364 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 150.5ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:02:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-05 21:02:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 672. [2021-10-05 21:02:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.599105812220566) internal successors, (1744), 671 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1744 transitions. [2021-10-05 21:02:52,384 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1744 transitions. Word has length 37 [2021-10-05 21:02:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:52,384 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1744 transitions. [2021-10-05 21:02:52,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1744 transitions. [2021-10-05 21:02:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:52,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:52,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:52,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 21:02:52,387 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2143919669, now seen corresponding path program 20 times [2021-10-05 21:02:52,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:52,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392575596] [2021-10-05 21:02:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:52,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:52,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:52,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392575596] [2021-10-05 21:02:52,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392575596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:52,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:52,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:52,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976435337] [2021-10-05 21:02:52,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:52,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:52,475 INFO L87 Difference]: Start difference. First operand 672 states and 1744 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:52,598 INFO L93 Difference]: Finished difference Result 878 states and 2204 transitions. [2021-10-05 21:02:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 21:02:52,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:52,601 INFO L225 Difference]: With dead ends: 878 [2021-10-05 21:02:52,602 INFO L226 Difference]: Without dead ends: 734 [2021-10-05 21:02:52,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 88.2ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:02:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-05 21:02:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 660. [2021-10-05 21:02:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 2.5918057663125946) internal successors, (1708), 659 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1708 transitions. [2021-10-05 21:02:52,619 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1708 transitions. Word has length 37 [2021-10-05 21:02:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:52,620 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 1708 transitions. [2021-10-05 21:02:52,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1708 transitions. [2021-10-05 21:02:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:52,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:52,622 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:52,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 21:02:52,623 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1837332457, now seen corresponding path program 21 times [2021-10-05 21:02:52,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:52,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427805858] [2021-10-05 21:02:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:52,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:52,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:52,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427805858] [2021-10-05 21:02:52,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427805858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:52,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:52,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:02:52,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919808368] [2021-10-05 21:02:52,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:02:52,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:02:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:02:52,711 INFO L87 Difference]: Start difference. First operand 660 states and 1708 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:52,818 INFO L93 Difference]: Finished difference Result 437 states and 1056 transitions. [2021-10-05 21:02:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 21:02:52,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:52,820 INFO L225 Difference]: With dead ends: 437 [2021-10-05 21:02:52,820 INFO L226 Difference]: Without dead ends: 233 [2021-10-05 21:02:52,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:02:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-05 21:02:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-05 21:02:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.2801724137931036) internal successors, (529), 232 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 529 transitions. [2021-10-05 21:02:52,827 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 529 transitions. Word has length 37 [2021-10-05 21:02:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:52,827 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 529 transitions. [2021-10-05 21:02:52,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 529 transitions. [2021-10-05 21:02:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:52,828 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:52,829 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:52,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 21:02:52,829 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 220660213, now seen corresponding path program 22 times [2021-10-05 21:02:52,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:52,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486625263] [2021-10-05 21:02:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:52,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:52,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:52,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486625263] [2021-10-05 21:02:52,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486625263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:52,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:52,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:52,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926813483] [2021-10-05 21:02:52,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:52,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:52,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:52,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:52,995 INFO L87 Difference]: Start difference. First operand 233 states and 529 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:53,303 INFO L93 Difference]: Finished difference Result 262 states and 563 transitions. [2021-10-05 21:02:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:02:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:53,305 INFO L225 Difference]: With dead ends: 262 [2021-10-05 21:02:53,305 INFO L226 Difference]: Without dead ends: 247 [2021-10-05 21:02:53,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:02:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-05 21:02:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2021-10-05 21:02:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.271551724137931) internal successors, (527), 232 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 527 transitions. [2021-10-05 21:02:53,311 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 527 transitions. Word has length 37 [2021-10-05 21:02:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:53,311 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 527 transitions. [2021-10-05 21:02:53,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 527 transitions. [2021-10-05 21:02:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:53,313 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:53,313 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:53,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 21:02:53,313 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1290017991, now seen corresponding path program 23 times [2021-10-05 21:02:53,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:53,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803354816] [2021-10-05 21:02:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:53,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:53,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:53,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803354816] [2021-10-05 21:02:53,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803354816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:53,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:53,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:53,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410910045] [2021-10-05 21:02:53,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:53,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:53,469 INFO L87 Difference]: Start difference. First operand 233 states and 527 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:53,788 INFO L93 Difference]: Finished difference Result 246 states and 542 transitions. [2021-10-05 21:02:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:02:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:53,790 INFO L225 Difference]: With dead ends: 246 [2021-10-05 21:02:53,790 INFO L226 Difference]: Without dead ends: 233 [2021-10-05 21:02:53,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 193.7ms TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:02:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-05 21:02:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-05 21:02:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.2629310344827585) internal successors, (525), 232 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 525 transitions. [2021-10-05 21:02:53,797 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 525 transitions. Word has length 37 [2021-10-05 21:02:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:53,797 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 525 transitions. [2021-10-05 21:02:53,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 525 transitions. [2021-10-05 21:02:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:53,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:53,799 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:53,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 21:02:53,799 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1809524173, now seen corresponding path program 24 times [2021-10-05 21:02:53,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:53,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387578102] [2021-10-05 21:02:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:53,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:53,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:53,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387578102] [2021-10-05 21:02:53,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387578102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:53,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:53,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:53,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820887391] [2021-10-05 21:02:53,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:53,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:53,973 INFO L87 Difference]: Start difference. First operand 233 states and 525 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:54,274 INFO L93 Difference]: Finished difference Result 244 states and 537 transitions. [2021-10-05 21:02:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:02:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:54,276 INFO L225 Difference]: With dead ends: 244 [2021-10-05 21:02:54,276 INFO L226 Difference]: Without dead ends: 209 [2021-10-05 21:02:54,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 187.0ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:02:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-05 21:02:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-10-05 21:02:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.2884615384615383) internal successors, (476), 208 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 476 transitions. [2021-10-05 21:02:54,284 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 476 transitions. Word has length 37 [2021-10-05 21:02:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:54,285 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 476 transitions. [2021-10-05 21:02:54,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 476 transitions. [2021-10-05 21:02:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:54,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:54,286 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:54,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 21:02:54,287 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:54,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash 168289765, now seen corresponding path program 25 times [2021-10-05 21:02:54,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:54,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022650950] [2021-10-05 21:02:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:54,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:54,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:54,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022650950] [2021-10-05 21:02:54,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022650950] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:54,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:54,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:54,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793865930] [2021-10-05 21:02:54,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:54,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:54,429 INFO L87 Difference]: Start difference. First operand 209 states and 476 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:54,681 INFO L93 Difference]: Finished difference Result 262 states and 571 transitions. [2021-10-05 21:02:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:02:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:54,683 INFO L225 Difference]: With dead ends: 262 [2021-10-05 21:02:54,683 INFO L226 Difference]: Without dead ends: 133 [2021-10-05 21:02:54,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 172.3ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:02:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-05 21:02:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-05 21:02:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2021-10-05 21:02:54,688 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 37 [2021-10-05 21:02:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:54,688 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2021-10-05 21:02:54,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2021-10-05 21:02:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 21:02:54,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:54,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:02:54,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 21:02:54,689 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1061711353, now seen corresponding path program 26 times [2021-10-05 21:02:54,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:54,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509753626] [2021-10-05 21:02:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:54,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:54,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:54,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509753626] [2021-10-05 21:02:54,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509753626] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:54,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:54,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:02:54,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872129733] [2021-10-05 21:02:54,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:02:54,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:02:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:02:54,843 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:02:55,058 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2021-10-05 21:02:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:02:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-05 21:02:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:02:55,059 INFO L225 Difference]: With dead ends: 132 [2021-10-05 21:02:55,059 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 21:02:55,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 167.1ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:02:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 21:02:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 21:02:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 21:02:55,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-10-05 21:02:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:02:55,061 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 21:02:55,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:02:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 21:02:55,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 21:02:55,064 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 21:02:55,066 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 21:02:55,067 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 21:02:55,067 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 21:02:55,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 21:02:55,072 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 21:02:55,072 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 21:02:55,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 09:02:55 BasicIcfg [2021-10-05 21:02:55,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 21:02:55,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 21:02:55,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 21:02:55,080 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 21:02:55,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:31" (3/4) ... [2021-10-05 21:02:55,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 21:02:55,091 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 21:02:55,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 21:02:55,092 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 21:02:55,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-05 21:02:55,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 21:02:55,099 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:02:55,099 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 21:02:55,143 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 21:02:55,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 21:02:55,145 INFO L168 Benchmark]: Toolchain (without parser) took 24782.87 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 34.8 MB in the beginning and 134.6 MB in the end (delta: -99.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,146 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:02:55,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.65 ms. Allocated memory is still 58.7 MB. Free memory was 34.4 MB in the beginning and 38.3 MB in the end (delta: -3.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.11 ms. Allocated memory is still 58.7 MB. Free memory was 38.3 MB in the beginning and 36.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,147 INFO L168 Benchmark]: Boogie Preprocessor took 83.37 ms. Allocated memory is still 58.7 MB. Free memory was 36.0 MB in the beginning and 34.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,147 INFO L168 Benchmark]: RCFGBuilder took 629.57 ms. Allocated memory is still 58.7 MB. Free memory was 34.5 MB in the beginning and 37.5 MB in the end (delta: -3.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,148 INFO L168 Benchmark]: TraceAbstraction took 23615.58 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 37.0 MB in the beginning and 138.8 MB in the end (delta: -101.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,148 INFO L168 Benchmark]: Witness Printer took 63.93 ms. Allocated memory is still 182.5 MB. Free memory was 138.8 MB in the beginning and 134.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:02:55,151 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.25 ms. Allocated memory is still 44.0 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.65 ms. Allocated memory is still 58.7 MB. Free memory was 34.4 MB in the beginning and 38.3 MB in the end (delta: -3.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.11 ms. Allocated memory is still 58.7 MB. Free memory was 38.3 MB in the beginning and 36.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 83.37 ms. Allocated memory is still 58.7 MB. Free memory was 36.0 MB in the beginning and 34.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 629.57 ms. Allocated memory is still 58.7 MB. Free memory was 34.5 MB in the beginning and 37.5 MB in the end (delta: -3.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23615.58 ms. Allocated memory was 58.7 MB in the beginning and 182.5 MB in the end (delta: 123.7 MB). Free memory was 37.0 MB in the beginning and 138.8 MB in the end (delta: -101.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. * Witness Printer took 63.93 ms. Allocated memory is still 182.5 MB. Free memory was 138.8 MB in the beginning and 134.6 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 Lipton Reduction Statistics: ReductionTime: 9328.6ms, 201 PlacesBefore, 51 PlacesAfterwards, 204 TransitionsBefore, 46 TransitionsAfterwards, 5124 CoEnabledTransitionPairs, 12 FixpointIterations, 100 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 23 ConcurrentYvCompositions, 8 ChoiceCompositions, 206 TotalNumberOfCompositions, 16438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10672, positive: 10188, positive conditional: 0, positive unconditional: 10188, negative: 484, negative conditional: 0, negative unconditional: 484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4341, positive: 4265, positive conditional: 0, positive unconditional: 4265, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4341, positive: 4224, positive conditional: 0, positive unconditional: 4224, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10672, positive: 5923, positive conditional: 0, positive unconditional: 5923, negative: 408, negative conditional: 0, negative unconditional: 408, unknown: 4341, unknown conditional: 0, unknown unconditional: 4341] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 428, Positive conditional cache size: 0, Positive unconditional cache size: 428, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 263 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23379.6ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 111.2ms, AutomataDifference: 8200.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9479.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1910 SDtfs, 4021 SDslu, 8709 SDs, 0 SdLazy, 6726 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3877.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 3894.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=6, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 760.2ms AutomataMinimizationTime, 27 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 97.4ms SsaConstructionTime, 1092.9ms SatisfiabilityAnalysisTime, 3223.1ms InterpolantComputationTime, 981 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 7644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 21:02:55,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...